输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
#include <iostream>
using namespace std;struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
ListNode* Merge_re(ListNode* pHead1, ListNode* pHead2)//递归
{
if(pHead1 == nullptr)
return pHead2;
if(pHead2 == nullptr)
return pHead1;
ListNode* newHead = nullptr;
if(pHead1->val < pHead2->val)
{
newHead = pHead1;
newHead->next = Merge_re(pHead1->next,pHead2);
}
else
{
newHead = pHead2;
newHead->next = Merge_re(pHead1,pHead2->next);
}
return newHead;
}
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)//非递归
{
if(pHead1 == nullptr)
return pHead2;
if(pHead2 == nullptr)
return pHead1;
ListNode* newHead = new ListNode(-1);
ListNode* root = newHead;
while(pHead1 != nullptr && pHead2 != nullptr)
{
if(pHead1->val < pHead2->val)
{
newHead->next = pHead1;
newHead = pHead1;
pHead1 = pHead1->next;
}
else{
newHead->next = pHead2;
newHead = pHead2;
pHead2 = pHead2->next;
}
}
if(pHead1 == nullptr)
newHead->next = pHead2;
if(pHead2 == nullptr)
newHead->next = pHead1;
return root->next;
}
int main(int argc, char **argv) {
ListNode* p1 = new ListNode(1);
p1->next = new ListNode(3);
p1->next->next = new ListNode(5);
ListNode* p2 = new ListNode(2);
p2->next = new ListNode(4);
p2->next->next = new ListNode(6);
ListNode* p = Merge_re(p1,p2);
std::cout << "Hello, world!" << std::endl;
return 0;
}