JS力扣刷题21. 合并两个有序链表

var mergeTwoLists = function(list1, list2) {
    //建立头节点
    let head = new ListNode();
    let p = list1, q = list2;
    //tmp指针遍历新链表
    let tmp = head;
    while(p && q){
        let res = new ListNode();
        tmp.next = res;
        if(p.val <= q.val){
            res.val = p.val;
            p = p.next;
        }else{
            res.val = q.val;
            q = q.next;
        }
        tmp = res;
    }
    if(p)tmp.next = p;
    if(q)tmp.next = q;
    //头结点为0，返回下一个有值得结点
    return head.next;
};