21. Merge Two Sorted Lists
Description
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.
Example:
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4
Solution: (Java)
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null)
return l2;
if (l2 == null)
return l1;
ListNode tmp = new ListNode(0);
ListNode ret = tmp;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
tmp.next = l1;
tmp = tmp.next;
l1 = l1.next;
} else {
tmp.next = l2;
tmp = tmp.next;
l2 = l2.next;
}
}
if (l1 != null)
tmp.next = l1;
if (l2 != null)
tmp.next = l2;
return ret.next;
}
}
思路
初始化一个节点,将指针不断指向当前 l1
和l2
中值较小的即可。