归并:
时间复杂度:,因为两个链表
空间复杂度:
因为进入 while 保证了 l1 和 l2 必定不为空,所有不用担心最后跳出循环时 cur 会为空
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* cur = new ListNode(0);
ListNode* res = cur;
while (l1 && l2) {
if (l1->val <= l2->val) {
cur->next = l1;
l1 = l1->next;
}
else {
cur->next = l2;
l2 = l2->next;
}
cur = cur->next;
}
cur->next = l1 ? l1 : l2;
return res->next;
}
};