题目链接
自己写的很笨重,直接分情况讨论的:
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
var mergeTwoLists = function(l1, l2) {
let dummy = new ListNode();
let cur = dummy;
while(l1 || l2){
while(l2 === null && l1 !== null){
cur.next = l1;
cur = cur.next;
l1 = l1.next;
}
while(l1 === null && l2 !== null){
cur.next = l2;
cur = cur.next;
l2 = l2.next;
}
if(l1!==null && l2 !==null){
if(l1.val >= l2.val){
cur.next = l2;
cur = cur.next;
l2 = l2.next;
}else{
cur.next = l1;
cur = cur.next;
l1 = l1.next;
}
}
}
return dummy.next;
};
但其实有很简单的写法:
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} l1
* @param {ListNode} l2
* @return {ListNode}
*/
var mergeTwoLists = function(l1, l2) {
let dummy = new ListNode();
let cur = dummy;
while(l1 && l2){
if(l1.val >= l2.val){
cur.next = l2;
l2 = l2.next;
}
else{
cur.next = l1;
l1 = l1.next;
}
//最后往前走放在这里了
cur = cur.next;
}
//然后整体都给他了
cur.next = l1 !== null ? l1:l2;
return dummy.next;
};