leetcode21. Merge Two Sorted Lists

归并排序，归并两路链表；两种写法
非递归：

/**
 * Definition for singly-linked list.
 * function ListNode(val, next) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.next = (next===undefined ? null : next)
 * }
 */
/**
 * @param {ListNode} l1
 * @param {ListNode} l2
 * @return {ListNode}
 */
var mergeTwoLists = function(l1, l2) {
    if (!l1) return l2;
    if (!l2) return l1;
    let node = new ListNode(0);
    let pHead = node; // pHead.next为新链表的首元素
    // 非递归
    while (l1 && l2) {
        // 指向更小的
        if (l1.val < l2.val) {
            node.next = l1;
            l1 = l1.next;
        } else {
            node.next = l2;
            l2 = l2.next;
        }
        node = node.next;
    }
    // 如果还有剩余，直接链接即可
    // 不是while，是if
    // 对每个node，都会赋值val，且node.next 为 null
    // 因此是node.next 而非 node 指向 l1
    if (l1) {
        node.next = l1;
    }
    if (l2) {
        node.next = l2;
    }
    return pHead.next; 
};

递归：分解到单个之后从后往前再组合

var mergeTwoLists = function(l1, l2) {
    if (!l1) return l2;
    if (!l2) return l1;
    let node = new ListNode(0);
    if (l1.val < l2.val) {
        node.val = l1.val;
        node.next = mergeTwoLists(l1.next, l2);
    } else {
        node.val = l2.val;
        node.next = mergeTwoLists(l1, l2.next);
    }
    return node;
};

https://blog.csdn.net/weixin_44523860/article/details/105552027