剑指offer 面试题17 合并两个有序链表

struct LinkNode{
int data;
LinkNode *next;
};
LinkNode* Merge(LinkNode *pHead1,LinkNode *pHead2){
if(pHead1==NULL){
return pHead2;
}
else if(pHead2==NULL){
return pHead1;
}
LinkNode *pMergeHead=NULL;
if(pHead1->data<pHead2->data){
pMergeHead=pHead1;
pMergeHead->next=Merge(pHead1->next,pHead2);
}
else{
pMergeHead=pHead2;
pMergeHead->nextMerge(pHead1,pHead2->next);
}
return pMergeHead;
}