https://leetcode.com/problems/merge-two-sorted-lists/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
/**
 * Definition for singly-linked list.
 * function ListNode(val) {
 *     this.val = val;
 *     this.next = null;
 * }
 */
/**
 * @param {ListNode} l1
 * @param {ListNode} l2
 * @return {ListNode}
 */
const mergeTwoLists = (l1, l2) => {
    let dummy = new ListNode()
    let t = dummy
    while (l1 && l2) {
        if (l1.val < l2.val) {
            t.next = l1
            l1 = l1.next
        }
        else {
            t.next = l2
            l2 = l2.next
        }
        t = t.next
    }
    t.next = l1 || l2
    return dummy.next
};