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

递归法

• 判断条件

        if (pHead1 == NULL) return pHead2;
        if (pHead2 == NULL) return pHead1;

• 比较节点值的大小

        if (pHead1->val < pHead2->val) {
            pHead1->next = Merge(pHead1->next, pHead2);
            return pHead1;
        }
        else {
            pHead2->next = Merge(pHead1, pHead2->next);
            return pHead2;
        }