剑指offer-合并链表

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

非递归版本：

/*
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;
        else if(pHead2==NULL)
            return pHead1;
        ListNode *Head=NULL;
        ListNode *current=NULL;//两个指针，一个是头指针，一个是工作遍历指针
		//选择头指针
        if(pHead1->val<=pHead2->val)
        {
            Head=pHead1;
        	pHead1=pHead1->next;
            //merge=merge->next;
        }
        
        else 
           {
            Head=pHead2;
        	pHead2=pHead2->next;
             
        }
        current=Head;
        while(pHead1!=NULL&&pHead2!=NULL)
            {
            if(pHead1->val<=pHead2->val)
                {
                current->next=pHead1;
                current=current->next;
                pHead1=pHead1->next;
            }
            else
                {
                current->next=pHead2;
                current=current->next;
                pHead2=pHead2->next;
            }
        }
		//若其中一个链表遍历完成，则直接将另外链表挂在新链表后面。
        if(pHead1==NULL)
            current->next=pHead2;
        if(pHead2==NULL)
            current->next=pHead1;
        return Head;
        
    }
};

递归版本：

/*
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;
        else if(pHead2==NULL)
            return pHead1;
        //ListNode* Head=NULL;
		if(pHead1->val<=pHead2->val)
		{
			pHead1->next=Merge(pHead1->next,pHead2);
			return pHead1;
		}
		else
		{
			pHead2->next=Merge(pHead1,pHead2->next);
			return pHead2;
		}
    }
};