输入两个单调递增的链表，输出两个链表合成后的链表，合并后仍然递增排序。

结点结构体：

struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};

方法1：

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;
	}
}

方法2：

ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
	if (pHead1 == NULL)
		return pHead2;
	if (pHead2 == NULL)
		return pHead1;
	ListNode* result = NULL;
	ListNode * last = NULL;
	if (pHead1->val <= pHead2->val)
	{
		result = last = pHead1;
		pHead1 = pHead1->next;
	}
	else
	{
		result = last = pHead2;
		pHead2 = pHead2->next;
	}
	while (pHead1 != NULL && pHead2 != NULL)
	{
		if (pHead1->val < pHead2->val)
		{
			last->next = pHead1;
			last = pHead1;
			pHead1 = pHead1->next;
		}
		else
		{
			last->next = pHead2;
			last = pHead2;
			pHead2 = pHead2->next;
		}
	}
	if (pHead1 == NULL)
	{
		last->next = pHead2;
	}
	else
	{
		last->next = pHead1;
	}
	return result;
}