合并两个排序的链表

题目描述：

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

解题思路：

两种解题思路，一种就是很普遍的递归法，第二种就是循环。我们能不能递归最好不用递归。

循环：
若链表1的头结点小于链表2的头结点，则链表1的头结点是合并后的头结点。遍历链表1、链表2，若链表1或链表2先遍历完，则将链表1或链表2未遍历完的部分直接拼接到合并链表后。

 

 

 

class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        if(NULL == pHead1 || NULL == pHead2)    //代码的健壮性
            return pHead1 == NULL ? pHead2 : pHead1;    //优雅性
        ListNode* Head = NULL;
        if(pHead1->val > pHead2->val)
        {
            Head = pHead2;
            pHead2 = pHead2->next;
        }
        else
        {
            Head = pHead1;
            pHead1 = pHead1->next;
        }
        ListNode* tail = Head;
        while(pHead1 && pHead2)
        {
            if(pHead1->val > pHead2->val)
            {
                tail->next = pHead2;
                tail = pHead2;                
                pHead2 = pHead2->next;
            }
            else
            {
                tail->next = pHead1;
                tail = pHead1;                
                pHead1 = pHead1->next;
            }
        }
        if(pHead1)
            tail->next = pHead1;
        if(pHead2)
            tail->next = pHead2;
        return Head;
    }
};

递归：

class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        if(NULL == pHead1 || NULL == pHead2)    //代码的健壮性
            return pHead1 == NULL ? pHead2 : pHead1;    //优雅性
        ListNode* Head = NULL;
        if(pHead1->val > pHead2->val)
        {
            Head = pHead2;
            pHead2->next = Merge(pHead1, pHead2->next);
        }
        else
        {
            Head = pHead1;
            pHead1->next = Merge(pHead1->next, pHead2);
        }
        return Head;
    }
};