问题描述
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
代码
var mergeTwoLists = function(l1, l2) {
let dummy = new ListNode(0);
let cur = dummy;
while(l1 && l2){
if(l1.val < l2.val) {
cur.next = l1;
cur = cur.next;
l1 = l1.next;
} else {
cur.next = l2;
cur = cur.next;
l2 = l2.next;
}
}
if(l1){
cur.next = l1;
}else {
cur.next = l2;
}
return dummy.next;
}