原题链接:JZ25 合并两个排序的链表
emmmm,我总结出来了,我的解题习惯就是,自己把自己绕晕。。。。
迭代写法:
/*
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)
return pHead2;
else if(!pHead2)
return pHead1;
if(pHead1->val>pHead2->val)
{
ListNode* tmp=pHead1;
pHead1=pHead2;
pHead2=tmp;
}
ListNode* pos=pHead2;
ListNode* root=pHead1;
ListNode* last;
while(pHead1 && pos) // !!! 段错误
{
if(pHead1->next && pHead1->val<=pos->val && pos->val<=(pHead1->next)->val)
{
ListNode* tmp=pos;
pos=pos->next;
tmp->next=pHead1->next;
pHead1->next=tmp;
}
if(pHead1->next==NULL)
last=pHead1;
pHead1=pHead1->next;
}
if(pos)
last->next=pos;
return root;
}
};
递归写法:
/*
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)
return pHead2;
if(!pHead2)
return pHead1;
if(pHead1->val<=pHead2->val)
{
pHead1->next=Merge(pHead1->next,pHead2);
return pHead1;
}
else
{
pHead2->next=Merge(pHead1,pHead2->next);
return pHead2;
}
}
};