给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 1:
输入:lists = [[1,4,5],[1,3,4],[2,6]] 输出:[1,1,2,3,4,4,5,6] 解释:链表数组如下: [ 1->4->5, 1->3->4, 2->6 ] 将它们合并到一个有序链表中得到。 1->1->2->3->4->4->5->6
示例 2:
输入:lists = [] 输出:[]
示例 3:
输入:lists = [[]] 输出:[]
提示:
k == lists.length
0 <= k <= 10^4
0 <= lists[i].length <= 500
-10^4 <= lists[i][j] <= 10^4
lists[i]
按 升序 排列lists[i].length
的总和不超过10^4
class Solution{
private:
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
auto dummy = new ListNode(-1);
auto node = dummy;
while (list1 && list2) {
if (list1 -> val < list2 -> val) {
node = node -> next = list1;
list1 = list1 -> next;
} else {
node = node -> next = list2;
list2 = list2 -> next;
}
}
node -> next = list1 ? list1 : list2;
return dummy -> next;
}
ListNode* dca_backtrack(vector<ListNode*>& lists, int left, int right) {
if (left == right) return lists[left];
int index = (right - left) / 2;
return mergeTwoLists(dca_backtrack(lists, left, left + index), dca_backtrack(lists, left + index + 1, right));
}
public:
ListNode* mergeKLists(vector<ListNode*>& lists) {
if (lists.size() == 0) return nullptr;
return dca_backtrack(lists, 0, lists.size()-1);
}
};
12 ms 98.62%
22.4 MB 8.36%