合并两个排序链表

输入两个递增排序的链表，合并这两个链表并使新链表中的节点仍然是递增排序的。

示例1：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

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