JZ16 --合并两个排序链表（JS）

---

题目描述：合并两个排序链表

---

输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。

---

题目解析：

---

function Merge(pHead1, pHead2)
{
    // write code here
    let vHead = new ListNode(-1);
    let pre = vHead;
    
    while(pHead1 && pHead2){
        if(pHead1.val < pHead2.val){
            pre.next = pHead1;
            pHead1 = pHead1.next
        } else{
            pre.next = pHead2;
            pHead2 = pHead2.next
        }
        pre = pre.next;
    }
    
    //如果pHead1 为空就将pHead2拼接在新链表后面，否则pHead1
    pre.next = pHead1 ? pHead1: pHead2;
    return vHead.next;
}

递归：

function Merge(pHead1, pHead2)
{
    // write code here
    let newHead=null;
    if(!pHead1) return pHead2;
    if(!pHead2) return pHead1;
    if(pHead1.val<pHead2.val){
        newHead = pHead1;
        newHead.next = Merge(pHead1.next,pHead2);
    }else{
        newHead=pHead2;
        newHead.next=Merge(pHead1,pHead2.next);
    }
    return newHead;
}