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.
题意:将两个有序链表合并得到一个新的有序链表
思路:……
代码:
/**
* 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) {
ListNode fakeHead = new ListNode(0);
ListNode current = fakeHead;
while (l1 != null || l2 != null) {
if (l1 == null || (l2 != null && l1.val >= l2.val)) {
current.next = l2;
current = l2;
l2 = l2.next;
} else {
current.next = l1;
current = l1;
l1 = l1.next;
}
}
return fakeHead.next;
}
}