合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
示例:
输入:
[
1->4->5,
1->3->4,
2->6
]
输出: 1->1->2->3->4->4->5->6
class Solution {
public:
ListNode* mergeKLists(vector<ListNode*>& lists) {
if(lists.size() == 0)
return NULL;
while(lists.size() > 1){
int index = 0;
for(int i = 0; i < lists.size() ; i += 2){
if(i + 1 == lists.size())
lists[index] = lists[i];
else
lists[index] = merge(lists[i], lists[i + 1]);
index ++;
}
while(lists.size() > index)
lists.pop_back();
}
return lists[0];
}
private:
ListNode* merge(ListNode* list1, ListNode* list2){
ListNode* dummyHead = new ListNode(-1);
ListNode* curNode = dummyHead;
while(list1 != NULL && list2 != NULL){
if(list1->val < list2->val){
curNode->next = list1;
list1 = list1->next;
}
else{
curNode->next = list2;
list2 = list2->next;
}
curNode = curNode->next;
curNode->next = NULL;
}
if(list1)
curNode->next = list1;
if(list2)
curNode->next = list2;
ListNode* ret = dummyHead->next;
delete dummyHead;
return ret;
}
};