Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
/**
* 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 NULL;
while(len > 1){
for(int i = 0; i < len / 2; i++){
lists[i] = merge(lists[i], lists[len - 1 - i]);
}
len = (len + 1) / 2;// 记住一定不是 len = len / 2 + 1, 因为如果len = 2的话 永远 = 2;
}
return lists.front();
}
ListNode* merge(ListNode* l1, ListNode* l2){
if(l1 == NULL) return l2;
if(l2 == NULL) return l1;
if(l1->val > l2->val) {
l2->next = merge(l1, l2->next);
return l2;
}else{
l1->next = merge(l1->next, l2);
return l1;
}
}
};