IMWeb提升营Day3 | 训练题16：合并两个排序的链表

题目描述

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

思路1：非递归

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};*/
/*
 * 思路1：非递归的方法
 */
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        if(pHead1 == NULL) return pHead2;
        if(pHead2 == NULL) return pHead1;
        ListNode* pMerge = NULL;
        ListNode* p = pMerge;
        while(pHead1 != NULL && pHead2 != NULL){
            if(pHead1->val < pHead2->val){
                if(pMerge == NULL){
                    pMerge = p = pHead1;
                }else{
                    p->next = pHead1;
                    p = p->next;
                }
                pHead1 = pHead1->next;
            }else{
                if(pMerge == NULL){
                    pMerge = p = pHead2;
                }else{
                    p->next = pHead2;
                    p = p->next;
                }
                pHead2 = pHead2->next;
            }
        }
        if(pHead1 == NULL) p->next = pHead2;
        else p->next = pHead1;
        return pMerge;
    }
};

思路二：递归

/*
 * 思路2：递归的方法
 */
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        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;
        }

    }
};