一. 递归
1. 两个链表较小的元素与剩下的元素merge并合并.
2. 时间复杂度O(n+m). 空间也为O(n+m). 有n+m个帧栈.
class Solution {
public:
//函数mergeTwoLists的作用是返回合并好的链表的头结点.
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
//递归终止条件.
if(l1==NULL) return l2;
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;
}
}
};
二. 迭代方法.
1. 直接指向了l1和l2,类似穿针引线,这样空间复杂度就为O(1).
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
//构造哑结点作为返回链表的头结点.
ListNode* dummy = new ListNode(0);
ListNode* cur = dummy;
while(l1!=NULL && l2!=NULL) {
if(l1->val<=l2->val) {
//直接指向l1,就不用再建立新的ListNode了.
cur->next = l1;
l1 = l1->next;
}
else {
cur->next = l2;
l2 = l2->next;
}
cur = cur->next;
}
if(l1==NULL) cur->next = l2;
if(l2==NULL) cur->next = l1;
return dummy->next;
}
};