首页 > 学院 > 开发设计 > 正文

【剑指offer】面试题17:合并两个排序的链表

2019-11-06 07:21:15
字体:
来源:转载
供稿:网友
//递归实现两个链表的合并ListNode* Merge(ListNode* pHead1, ListNode* pHead2){ if (pHead1 == NULL) { return pHead2; } else if (pHead2 == NULL) { return pHead1; } ListNode* pMergedHead = NULL; if (pHead1->m_nValue < pHead2->m_nValue) { pMergedHead = pHead1; pMergedHead->m_pNext = Merge(pHead1->m_pNext, pHead2); } else { pMergedHead = pHead2; pMergedHead->m_pNext = Merge(pHead1, pHead2->m_pNext); } return pMergedHead;}
发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表