两种思路:双指针或递归
思路1:双指针,贼简单,正常逻辑
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1==NULL)return l2;
if(l2==NULL)return l1;
ListNode*dummy=new ListNode(-1);
ListNode*t=dummy;
while(l1!=NULL&&l2!=NULL)
{
if(l1->val<l2->val)
{
t->next=l1;
l1=l1->next;
t=t->next;
}
else
{
t->next=l2;
l2=l2->next;
t=t->next;
}
}
if(l1==NULL)
{
t->next=l2;
}
else
{
t->next=l1;
}
return dummy->next;
}
};
法2:递归三部曲
递归结束的条件: 子链表1或子链表2的任意一个为NULL,那么只需要返回非空的子链表。
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if (l1 == NULL)
return l2;
else if (l2 == NULL)
return l1;
if (l1->val <= l2->val)
{
l1->next = mergeTwoLists(l1->next, l2);//已经完成了后面结点的合并
return l1;
}
else
{
l2->next = mergeTwoLists(l1, l2->next);//已经完成了后面结点的合并
return l2;
}
}
};