题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
ListNode* pHead=NULL;
if(pHead1==NULL)
return pHead2;
else if(pHead2==NULL)
return pHead1;
if(pHead1->val < pHead2->val)
{
pHead=pHead1;
pHead->next=Merge(pHead1->next,pHead2);
}else{
pHead=pHead2;
pHead->next=Merge(pHead1,pHead2->next);
}
return pHead;
}
};
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
ListNode* pHead3=NULL;
if(pHead1==NULL)
return pHead2;
if(pHead2==NULL)
return pHead1;
while( pHead1!=NULL && pHead2!=NULL )
{//当两个都不为NULL时,谁小就把谁赋值给pHead3
if(pHead1->val <= pHead2->val)
{
pHead3->val = pHead1->val;
pHead1=pHead1->next;
pHead3=pHead3->next;
}else{
pHead3->val = pHead2->val;
pHead2=pHead2->next;
pHead3=pHead3->next;
}
}
//当两个都不为NULL时,谁小就把谁赋值给pHead3
while(pHead1==NULL && pHead2!=NULL)
{
pHead3->val = pHead2->val;
pHead2=pHead2->next;
pHead3=pHead3->next;
}
while(pHead2==NULL && pHead1!=NULL)
{
pHead3->val = pHead1->val;
pHead1=pHead1->next;
pHead3=pHead3->next;
}
return pHead;
}
};
这个代码有问题?想想有什么问题?