题意: 给定一系列有序链表,将有序列表合成一个。
分析:最直观的方法就是按照桶排序的方法进行遍历,时间复杂度是O(n * k); 但是如果熟悉堆排序的话就会发现,这里如果维护一个最小堆的话就会将每次遍历的复杂度K降到log(K)。由于最小堆可以通过数组来实现,所以这里不用新申请内存空间,空间复杂度为O(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) {
if (lists.size() == 0) return NULL;
for (int i = lists.size()/2; i >= 0;--i)refreshHeap(lists, i);
ListNode* head = new ListNode(0);
ListNode* temp = head;
while(lists[0] != NULL){
temp->next = lists[0];
lists[0] = lists[0]->next;
refreshHeap(lists, 0);
temp = temp->next;
}
temp = head->next;
delete head;
return temp;
}
void swap(vector<ListNode*>& lists, int i, int j){
ListNode* temp = lists[i];
lists[i] = lists[j];
lists[j] = temp;
}
void refreshHeap(vector<ListNode*>& lists, int i){
while(true){
if (2*i+1 >= lists.size() || (lists[2*i+1] == NULL &&(2*i+2>=lists.size() || lists[2*i+2] == NULL))) break;
int add = 1;
if (2*i+2 < lists.size() && lists[2*i+2] != NULL && (lists[2*i+1] == NULL || lists[2*i+1]->val > lists[2*i+2]->val)) add = 2;
if (lists[i] == NULL || lists[i]->val > lists[2*i+add]->val) swap(lists,i,2*i+add);
else break;
i = 2*i+add;
}
}
};