剑指Offer之 - 合并两个排序的链表

题目：

输入两个递增排序的链表，合并这两个链表并使新链表中的结点仍然是按照递增排序的。

思路：

1、迭代（注意定义虚拟头结点）。

2、递归。

代码：

#include <iostream>
using namespace std;

struct ListNode
{
	int m_nValue;
	ListNode *m_pNext;
	ListNode(){}
	ListNode(int x):m_nValue(x),m_pNext(NULL){}
};

//功能：合并两个有序的链表
//迭代法
ListNode *Merge(ListNode *pHead1 , ListNode *pHead2)
{
	if(pHead1 == NULL)
		return pHead2;
	if(pHead2 == NULL)
		return pHead1;
	ListNode *dummy = new ListNode(-1);//定义一个虚拟头结点
	ListNode *p = dummy , *p1 = pHead1 , *p2 = pHead2;
	while(p1 && p2)
	{
		if(p1->m_nValue < p2->m_nValue)
		{
			p->m_pNext = p1;
			p1 = p1->m_pNext;
		}
		else
		{
			p->m_pNext = p2;
			p2 = p2->m_pNext;
		}
		p = p->m_pNext;
	}
	if(p1 == NULL)
	{
		p->m_pNext = p2;
	}
	if(p2 == NULL)
	{
		p->m_pNext = p1;
	}
	return dummy->m_pNext;
}

//递归解法：
ListNode *MergeRecurisely(ListNode *pHead1 , ListNode *pHead2)
{
	if(pHead1 == NULL)
		return pHead2;
	if(pHead2 == NULL)
		return pHead1;
	ListNode *pMergedHead = NULL;
	if(pHead1->m_nValue < pHead2->m_nValue)
	{
		pMergedHead = pHead1;
		pMergedHead->m_pNext = MergeRecurisely(pHead1->m_pNext , pHead2);
	}
	else
	{
		pMergedHead = pHead2;
		pMergedHead->m_pNext = MergeRecurisely(pHead1 , pHead2->m_pNext);
	}
	return pMergedHead;
}

int main()
{
	ListNode *p1 = new ListNode(1);
	ListNode *p2 = new ListNode(2);
	ListNode *p3 = new ListNode(3);
	ListNode *p4 = new ListNode(4);
	p1->m_pNext = p3;
	p2->m_pNext = p4;
	ListNode *p = Merge(p1 , p2);
	//ListNode *p = MergeRecurisely(p1 , p2);
	while(p)
	{
		cout<<p->m_nValue<<" ";
		p = p->m_pNext;
	}
	cout<<endl;
	return 0;
}