[Algorithm] 21. Merge Two Sorted Lists

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.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

Solution 1:

var mergeTwoLists = function(l1, l2) {
    if (!l1 && !l2) {
        return null;
    }
    
    if (!l1 && l2) {
        return l2;
    } 
    
    if (!l2 && l1) {
        return l1;
    }
    
    const smallerNode = l1.val <= l2.val ? l1 : l2;
    if (smallerNode.val === l1.val) {
        smallerNode.next = mergeTwoLists(l1.next, l2);
    } else {
        smallerNode.next = mergeTwoLists(l1, l2.next);
    }
    
    return smallerNode;
}

Solution 2: Better

/**
 * 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 curr = temp = new ListNode(0)
    
    while (l1 && l2) {
        if (l1.val < l2.val) {
            curr.next = l1;
            l1 = l1.next;
        } else {
            curr.next = l2;
            l2 = l2.next;
        }
        curr = curr.next;
    }
    
    if (l1) {
        curr.next = l1;
    }
    
    if (l2) {
        curr.next = l2;
    }
    
    return temp.next;
};