合并两个排序的链表

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

使用C/C++实现，代码如下：

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
    {
        if ((NULL == pHead1)&&(NULL == pHead2)){
            return NULL;
        }

        ListNode *pListHead = NULL;
        ListNode *pListTemp = NULL;    

        while ((NULL != pHead1)&&(NULL != pHead2)){
            if (pHead1->val < pHead2->val){
                if (NULL == pListHead){
                    pListHead = pHead1;
                    pListTemp = pHead1;
                }
                else{
                    pListTemp->next = pHead1; 
                    pListTemp = pListTemp->next;                                       
                }

                pHead1 = pHead1->next;
            } 
            else{
                if (NULL == pListHead){
                    pListHead = pHead2;
                    pListTemp = pHead2;
                }
                else{
                    pListTemp->next = pHead2;
                    pListTemp = pListTemp->next;                    
                }

                pHead2 = pHead2->next;
            }       
        }

        while (NULL != pHead1){            
            if (NULL == pListHead){
                pListHead = pHead1;
                pListTemp = pHead1;
            }
            else{
                pListTemp->next = pHead1; 
                pListTemp = pListTemp->next;  
            }

            pHead1 = pHead1->next;
        }

        while (NULL != pHead2){     
            if (NULL == pListHead){
                pListHead = pHead1;
                pListTemp = pHead1;
            }
            else{
                pListTemp->next = pHead2;
                pListTemp = pListTemp->next;
            }     

            pHead2 = pHead2->next;
        }

        return pListHead;
    }
};