合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
示例:
输入:
[
1->4->5,
1->3->4,
2->6
]
输出: 1->1->2->3->4->4->5->6
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-k-sorted-lists
参考:
https://leetcode-cn.com/problems/merge-k-sorted-lists/solution/c-you-xian-dui-lie-liang-liang-he-bing-fen-zhi-he-/
https://www.cnblogs.com/grandyang/p/4606710.html
方法:维护长度为k的优先队列。一开始往队列里面放k个链表的头节点,然后把最小的取出,相应的补充,直到没有节点,循环结束。
class Solution {
public:
struct cmp{
bool operator()(ListNode* a, ListNode* b){
return a->val > b->val; //最小堆的定义,所以不需要纠结
}
};
ListNode* mergeKLists(vector<ListNode*>& lists) {
priority_queue<ListNode*, vector<ListNode*>, cmp> pq;
//k个链表的头节点最小堆。因为是链表,所以只有头节点放进去
for(auto node: lists){
if(node) pq.push(node);
}
ListNode *dummynode = new ListNode(0), *cur = dummynode;
while(!pq.empty()){
auto t = pq.top(); pq.pop();
cur->next = t;
cur = cur->next;
if(cur->next) pq.push(cur->next);
}
ListNode *res = dummynode->next;
delete dummynode;
return res;
}
};