16、剑指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* pHead = NULL;
        ListNode* pHeadMerge = NULL;
        while(pHead1 != NULL && pHead2 != NULL){
            if(pHead1->val < pHead2->val){
                if(pHeadMerge == NULL){
                    pHeadMerge = pHead1;
                    pHead = pHeadMerge;
                }else{
                    pHeadMerge->next = pHead1;
                    pHeadMerge = pHeadMerge->next;
                }
                pHead1 = pHead1->next;
            }else{
                if(pHeadMerge == NULL){
                    pHeadMerge = pHead2;
                    pHead = pHeadMerge;
                }else{
                    pHeadMerge->next = pHead2;
                    pHeadMerge = pHeadMerge->next;
                }
                pHead2 = pHead2->next;
            }
        }
        if(pHead1 == NULL){
            pHeadMerge->next = pHead2;
        }else if(pHead2 == NULL){
            pHeadMerge->next = pHead1;
        }
        return pHead;
    }
};