题解 | #合并两个排序的链表#

题目描述

解题思路 设置一个空链表res

pre为指针初始值指向链表res第一个元素

遍历两个链表，按照规则将元素有序放入链表res中

function Merge(pHead1, pHead2)
{
    // write code here
    let res = {};
    let pre = res;
    if(pHead1 == null) return pHead2;
    if(pHead2 == null) return pHead1;
    while(pHead1 != null && pHead2 != null) {
        if(pHead1.val > pHead2.val) {
            pre.next = pHead2;
            pHead2 = pHead2.next
        } else{
            pre.next = pHead1;
            pHead1 = pHead1.next
        }
        pre = pre.next
    }
    pre.next = pHead1 !== null ? pHead1 : pHead2
    return res.next
}