LeetCode——Merge Two Sorted Lists
Posted liguangsunls
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode——Merge Two Sorted Lists相关的知识,希望对你有一定的参考价值。
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
原题链接:https://oj.leetcode.com/problems/merge-two-sorted-lists/
题目:归并两个有序链表,返回一个新的有序链表。
思路:同归并数组的解法一样,依次比較首位元素。
public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode p1 = l1, p2 = l2, dummy = new ListNode(-1), p = dummy; while (p1 != null && p2 != null) { if (p1.val <= p2.val) { p.next = p1; p1 = p1.next; } else { p.next = p2; p2 = p2.next; } p = p.next; } if (p1 != null) p.next = p1; if (p2 != null) p.next = p2; return dummy.next; }
以上是关于LeetCode——Merge Two Sorted Lists的主要内容,如果未能解决你的问题,请参考以下文章
[leetcode]Merge Two Sorted Lists
LeetCode - 21. Merge Two Sorted Lists
Leetcode---21. Merge Two Sorted Lists
[LeetCode] Merge Two Binary Trees