剑指offer:合并两个排序的链表

题目描述

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

 

AC C++ Solution:

class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        ListNode pre(0);
        ListNode* res = ⪯
        
        while(pHead1 && pHead2) {                //当其中一条链表遍历结束,跳出循环
            if(pHead1->val < pHead2->val) {
                res->next = pHead1;
                pHead1 = pHead1->next;
            }
            
            else {
                res->next = pHead2;
                pHead2 = pHead2->next;
            }
            
            res = res->next;
        }
        
        res->next = pHead1 ? pHead1 : pHead2;    //有一条链表已经合成完毕
        
        return pre.next;
    }
};