【LeetCode】【esay】【13】合并两个有序列表

将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例：

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

// @lc code=start
/**
 * 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 comm = new ListNode();
    let dummy = comm;

    while(l1!==null&&l2!==null){

        if(l1.val < l2.val){

            comm.next = l1;
            l1 = l1.next;
            comm = comm.next;
        }
        else if(l1.val == l2.val){
            comm.next = l1;
            l1 = l1.next;
            comm = comm.next;
            comm.next = l2;
            l2 = l2.next;
            comm = comm.next;
        }
        else{
            comm.next = l2;
            l2 = l2.next;
            comm = comm.next;
        }
        // comm = comm.next;
    }

    if(l1!==null){
        comm.next = l1;
    }

    if(l2!==null){
        comm.next = l2;
    }
    return dummy.next;

};