给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* a, ListNode* b) {
if (!a) {
return b;
}
if (!b) {
return a;
}
ListNode* start;
if (a->val < b->val) {
start = a;
a = a->next;
} else {
start = b;
b = b->next;
}
ListNode* node = start;
while (a != nullptr && b != nullptr) {
if (a->val < b->val) {
node->next = a;
a = a->next;
} else {
node->next = b;
b = b->next;
}
node = node->next;
}
if (a != nullptr) {
node->next = a;
}
if (b != nullptr) {
node->next = b;
}
return start;
}
ListNode* mergeKLists(vector<ListNode*>& lists) {
if (lists.empty()) {
return nullptr;
}
ListNode* merged = lists[0];
for (int i = 1; i < lists.size(); i++) {
merged = mergeTwoLists(merged, lists[i]);
}
return merged;
}
};