//递归
ListNode* Merge( ListNode* pHead1, ListNoe* pHead2 )
{
if ( NULL == pHead1 )
return pHead2;
else if ( NULL == pHead2 )
return pHead1;
ListNode* pMergedHead = NULL;
if ( pHead1->val < pHead2->val ){
pMergeHead = pHead1;
pMergeHead->next = Merge( pHead1->next, pHead2 );
}
else{
pMergeHead = pHead2;
pMergeHead->next = Merge( pHead1, pHead2->next );
}
return pMergedHead;
}
合并两个有序的链表使新链表依然有序(不开辟新空间,在原链表上操作。 递归版本)
最新推荐文章于 2021-11-21 21:32:08 发布