23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
题目大意
合并k
个已经排好序的序列。
解题思路
一开始没有考虑空间复杂度,将k个序列用分治法的思路进行合并,而合并两个序列依然是使用分治法,所以整个算法的时间复杂度为 O((logn)2) 。
ListNode *dividedList(vector<ListNode*> lists, int left, int right) {
if (left >= right) return lists[left];
int mid = (left + right) / 2;
return mergeTwoLists(dividedList(lists, left, mid), dividedList(lists, mid+1, right));
}
ListNode *mergeKLists(vector<ListNode *> &lists) {
int k = lists.size();
if (k == 0) return NULL;
return dividedList(lists, 0, k-1);
}
但是,这种算法没有考虑过空间复杂度,导致无法通过一个检测空间复杂度的测例。
于是,我考虑在合并的序列的时候不使用递归,以减少空间复杂度。
ListNode *mergeKLists(vector<ListNode *> &lists) {
int k = lists.size();
if (k == 0) return NULL;
while (k-1) {
int mid = (k+1) / 2;
for (int i = 0; i < k / 2; i++) {
lists[i] = mergeTwoLists(lists[i], lists[mid+i]);
}
k = mid;
}
return lists[0];
}
算法复杂度
O((logn)2)
代码实现
/**
* 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 k = lists.size();
if (k == 0) return NULL;
while (k-1) {
int mid = (k+1) / 2;
for (int i = 0; i < k / 2; i++) {
lists[i] = mergeTwoLists(lists[i], lists[i + mid]);
}
k = mid;
}
return lists[0];
}
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if (l1 == NULL) return l2;
if (l2 == NULL) return l1;
if (l1->val < l2->val) {
l1->next = mergeTwoLists(l1->next, l2);
return l1;
} else {
l2->next = mergeTwoLists(l1, l2->next);
return l2;
}
}
};