个人思路总结:
本题有两种方法可以实现:(1)分治法(2)利用小顶堆
(1)分治法:
突然觉得分治法很有哲学思想啊,大事化小,小事化了。跟归并排序的思维一样,不再详细叙述了,直接上代码。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* mergeKLists(vector<ListNode*>& lists) {
int len = lists.size();
if(len==0)
return nullptr;
if(len==1)
return lists[0];
if(len==2)
return mergetwolists(lists[0],lists[1]);
int mid = len/2;
vector<ListNode*> lists1,lists2;
for(int i=0;i<mid;i++)
lists1.push_back(lists[i]);
for(int i=mid;i<len;i++)
lists2.push_back(lists[i]);
return mergetwolists(mergeKLists(lists1),mergeKLists(lists2));
}
ListNode* mergetwolists(ListNode* l1, ListNode* l2)
{
ListNode* head = new ListNode(0);
ListNode* tmp = head;
while(l1!=nullptr&&l2!=nullptr)
{
if(l1->val<l2->val)
{
tmp->next = l1;
tmp = tmp->next;
l1 = l1->next;
}
else
{
tmp->next = l2;
tmp = tmp->next;
l2 = l2->next;
}
}
if(l1==nullptr)
tmp->next = l2;
if(l2==nullptr)
tmp->next = l1;
return head->next;
}
};
(2)小顶堆
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
struct cmp
{
bool operator()(ListNode* a,ListNode* b)
{
return a->val > b->val; //小顶堆
}
};
ListNode* mergeKLists(vector<ListNode*>& lists) {
if(lists.size() == 0){
return nullptr;
}
if(lists.size() == 1){
return lists[0];
}
priority_queue<ListNode*, vector<ListNode*>, cmp> B;
for(int i=0;i<lists.size();i++){
if(lists[i]==NULL)
continue;
B.push(lists[i]);
}
ListNode *res=NULL,*cur=NULL;
while(!B.empty()){
ListNode *t=B.top();
B.pop();
if(res==NULL){
res=cur=t;
}else{
cur=cur->next=t;
}
if(t->next!=NULL){
B.push(t->next);
}
}
return res;
}
};