https://leetcode.com/problems/merge-two-sorted-lists/
解题思路:
这道题是将两个有序链表归并。首先我们定义一个 dummy node,用来指向表头。接着遍历两个链表,将每个位置上的较小者添加到 dummy node 后面,并及时更新指针,指向下一位。最后如果两个链表不一样长,要记得将剩余的元素添加到末尾。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null && l2 == null) return null;
ListNode dummy = new ListNode(0);
ListNode prev = dummy;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
prev.next = l1;
l1 = l1.next;
} else {
prev.next = l2;
l2 = l2.next;
}
prev = prev.next;
}
if (l1 != null) prev.next = l1;
if (l2 != null) prev.next = l2;
return dummy.next;
}
}