剑指offer：合并两个排序的链表（C++）

题目描述

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

思路一： 递归。

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        if (pHead1 == NULL) return pHead2;
        if (pHead2 == NULL) return pHead1;
        
        ListNode *mergeHead = NULL;
        
        if (pHead1 -> val < pHead2 -> val)
        {
            mergeHead = pHead1;
            mergeHead -> next = Merge(pHead1 -> next, pHead2);
        }
        else
        {
            mergeHead = pHead2;
            mergeHead -> next = Merge(pHead1, pHead2 -> next);
        }
        
        return mergeHead;
    }
};

思路二： 非递归。

class SolutionMerge {
public:
    //循环方式
    ListNode* Merge2(ListNode* pHead1, ListNode* pHead2)
    {       
        if (pHead1 == nullptr)
            return pHead2;
        if (pHead2 == nullptr)
            return pHead1;
        ListNode* mergeHead = nullptr;
        if (pHead1->val < pHead2->val)
        {
            mergeHead = pHead1;
            pHead1 = pHead1->next;
        }
        else
        {
            mergeHead = pHead2;
            pHead2 = pHead2->next;
        }
        ListNode* pCur = mergeHead;
        //递归改为循环
        while (pHead1 != nullptr && pHead2 != nullptr)
        {
            if (pHead1->val < pHead2->val)
            {
                pCur->next = pHead1;
                pHead1 = pHead1->next;
            }
            else
            {
                pCur->next = pHead2;
                pHead2 = pHead2->next;
            }
            pCur = pCur->next;
        }
        if (pHead1 == nullptr)
            pCur->next = pHead2;
        if (pHead2 == nullptr)
            pCur->next = pHead1;
        return mergeHead;
    }
    void PrintList(ListNode* pHead)
    {
        if (pHead == nullptr)
            return;
        ListNode* pNode = pHead;
        while (pNode != nullptr)
        {
            cout << pNode->val << endl;
            pNode = pNode->next;
        }
    }
};

参考（值得看看可以AC的代码是什么样的）

https://blog.csdn.net/qq_29542611/article/details/80552270