合并 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
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
ListNode* merge(vector<ListNode*>& lists, int s, int e){
if(s==e) return lists[s];
int mid = (e-s)/2+s;
static ListNode* l1 = merge(lists, s, mid);
static ListNode* l2 = merge(lists, mid+1, e);
return mergeTWO(l1,l2);
}
ListNode* mergeTWO(ListNode* a, ListNode* b){
if(!a) return b;
if(!b) return a;
if(a->val<b->val){
a->next=mergeTWO(a->next,b);
return a;
}
else {
b->next=mergeTWO(a,b->next);
return b;
}
}
ListNode* mergeKLists(vector<ListNode*>& lists) {
int size = lists.size();
static ListNode* root= merge(lists, 0, size-1);
return root;
}
};
网友答案:优先级队列
class Solution {
public:
struct cmp{bool operator()(ListNode* l1, ListNode* l2){return l1->val > l2->val;}};
ListNode* mergeKLists(vector<ListNode*>& lists){
ListNode* phead = new ListNode(0); ListNode* p = phead;
if(lists.size() == 0) return nullptr;
priority_queue<ListNode*, vector<ListNode*>, cmp> MinHeap;
for(int i = 0;i < lists.size();i++) if(lists[i] != nullptr)MinHeap.push(lists[i]);
while(!MinHeap.empty()){
p->next = MinHeap.top();p = p->next;
if(MinHeap.top()->next != nullptr) MinHeap.push(MinHeap.top()->next);MinHeap.pop();
}
return phead->next;
}
};
作者:tai-er-si-can-xing
链接:https://leetcode-cn.com/problems/merge-k-sorted-lists/solution/cyou-xian-dui-lie-he-bing-by-tai-er-si-can-xing/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。