[剑指offer]面试题17：合并两个排序的数组

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

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};*/
class Solution {
public:
    ListNode* Merge(ListNode* pHead1, ListNode* pHead2){
        ListNode* newHead = new ListNode(-1);
        ListNode* pCur = newHead;
        while(pHead1 || pHead2){
            if(pHead1 == NULL){
                pCur->next = pHead2;
                break;
            }else if(pHead2 == NULL){
                pCur->next = pHead1;
                break;
            }else if(pHead1->val < pHead2->val){
                pCur->next = pHead1;
                pHead1 = pHead1->next;
            }else{
                pCur->next = pHead2;
                pHead2 = pHead2->next;
            }
            pCur = pCur->next;
        }
        return newHead->next;
    }
};