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

代码

class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
        ListNode* list = new ListNode(-1);
        ListNode* p = list;
        while (pHead1 && pHead2) {
            if (pHead1->val <= pHead2->val) {
                p->next = pHead1;
                pHead1 = pHead1->next;
                p=p->next;
            }else {
                p->next = pHead2;
                pHead2 = pHead2->next;
                p=p->next;
            }
        }
        while (pHead1) {
            p->next = pHead1;
            pHead1 = pHead1->next;
            p=p->next;
        }
        while (pHead2) {
            p->next = pHead2;
            pHead2 = pHead2->next;
            p=p->next;
        }
        return list->next;
    }
};

思路
依次从两边链表中拿一个小的节点即可。