23、合并有序链表

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

/*
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* Newp;
        if( pHead1->val > pHead2->val ){
            Newp = pHead2;
            Newp->next = Merge(pHead1,pHead2->next);
        }
        if( pHead1->val <= pHead2->val ){
            Newp = pHead1;
            Newp->next = Merge(pHead1->next,pHead2);
        }
        return Newp;
    }
};