合并两个有序链表（面试）

/*
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;
        }
        if(pHead2==NULL)
        {
            return pHead1;
        }
        ListNode* NewList=new ListNode(0);
        if(pHead1->val<=pHead2->val)
        {
            NewList=pHead1;
            NewList->next=Merge(pHead1->next,pHead2);
        }
        else
        {
            NewList=pHead2;
            NewList->next=Merge(pHead1,pHead2->next);
        }
       
        return NewList;
        
        
    }
};