LeetCode 23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
Example:
Input:
[
1->4->5,
1->3->4,
2->6
]
Output: 1->1->2->3->4->4->5->6
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* Merge(ListNode *l1,ListNode *l2){
if(l1==NULL) return l2;
if(l2==NULL) return l1;
if(l1->val <= l2->val){
l1->next = Merge(l1->next,l2);
return l1;
}
else{
l2->next = Merge(l1,l2->next);
return l2;
}
}
ListNode* mergeKLists(vector<ListNode*>& lists) {
if(lists.empty()) return NULL;
int len =lists.size();
while(len>1){
for(int i=0;i<len/2;i++){//divide
lists[i]=Merge(lists[i],lists[len-i-1]);
}
len=(len+1)/2;
}
return lists.front();
}
};