给你一个链表数组,每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中,返回合并后的链表。
示例 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
刚刚学了堆,尝试用priority_queue 做一下,一开始添加的重载 operator< 没有成功,知识还是有些欠缺。在评论区学会了在函数内定义:
auto cmp = [](ListNode* a, ListNode* b) {return a->val > b->val; };
最终4ms打败99%
/**
* 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* mergeKLists(vector<ListNode*>& lists) {
auto cmp = [](ListNode* a, ListNode* b) {return a->val > b->val; };
priority_queue<ListNode*, vector<ListNode*>, decltype(cmp)> khead;
ListNode* res = new ListNode();
ListNode* idx = res;
for (int i = 0; i < lists.size(); i++) {
if(lists[i] != NULL)khead.push(lists[i]);
}
while (khead.size() > 0) {
ListNode* cur = khead.top();
khead.pop();
idx->next = cur;
idx = idx->next;
cur = cur->next;
if (cur != NULL) {
khead.push(cur);
}
}
return res->next;
}
};