第60题 Merge k Sorted Lists

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Hide Tags

  Divide and Conquer Linked List Heap

Code in C++:

/**
 * 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;
        return devide(lists, 0, lists.size()-1);
        
    }
    
    ListNode* devide(vector<ListNode*>& lists, int start, int end){
        if(start==end)  return lists[start];
        else{
            int middle = (start+end)/2;
            ListNode *left = devide(lists, start, middle);
            ListNode *right = devide(lists, middle+1, end);
            return merge2Lists(left, right);
        }
    }
    
    ListNode* merge2Lists(ListNode* l1, ListNode* l2){
        ListNode fakeHead(0);
        ListNode* ptr = &fakeHead;
        while(l1&&l2){
            if(l1->val<l2->val){
                ptr->next = l1;
                l1=l1->next;
            }else{
                ptr->next = l2;
                l2 = l2->next;
            }
            ptr=ptr->next;
        }
        ptr->next = l1?l1:l2;
        return fakeHead.next;
    }
};

Note: C++中NULL为四个大写