题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
非递归:
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
if(pHead1 == NULL)
return pHead2;
if(pHead2 == NULL)
return pHead1;
ListNode *newHead = new ListNode(0);
ListNode *p = newHead;
while(pHead1 && pHead2)
{
if(pHead1->val >= pHead2->val)
{
p->next = pHead2;
pHead2 = pHead2->next;
}
else
{
p->next = pHead1;
pHead1 = pHead1->next;
}
p = p->next;
}
while(pHead1)
{
p->next = pHead1;
pHead1 = pHead1->next;
p = p->next;
}
while(pHead2)
{
p->next = pHead2;
pHead2 = pHead2->next;
p = p->next;
}
return newHead->next;
}
};
递归:
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
if(pHead1 == NULL)
return pHead2;
if(pHead2 == NULL)
return pHead1;
ListNode *newHead = NULL;
if(pHead1->val > pHead2->val)
{
newHead = pHead2;
newHead->next = Merge(pHead1, pHead2->next);
}
else{
newHead = pHead1;
newHead->next = Merge(pHead1->next, pHead2);
}
return newHead;
}
};