offer面试题-----两个升序链表的合并

ListNode * Merge(ListNode *pList1,ListNode *pList2)
{
ListNode *pMergedList = NULL;
if(pList1 == NULL)
pMergedList = pList2;
if(pList2 == NULL)
pMergedList = pList1;
{
pMergedList = pList1;
pMergedList->next = Merge（pList1->next,pList2）;
}
else
{
pMergedList = pList2;
pMergedList->next = Merge(pList1,pList2->next);
}
return pMergedList;

}

本函数采用递归的操作方法，将两个链表依次做比较，并将结果返回，直到结束；