23. Merge k Sorted Lists

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) {
        return MergeSort(lists, 0, lists.size() - 1);
    }
    
    //合并两条有序的单链表
    ListNode* Merge(ListNode* l1, ListNode* l2) {
        if(!l1) return l2;
        if(!l2) 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* MergeSort(vector<ListNode*>& lists, int l, int r) {
        if(l == r) return lists[l];
        if(l < r)
        {
            int mid = (l + r) / 2;
            ListNode* l1 = MergeSort(lists, l, mid);
            ListNode* l2 = MergeSort(lists, mid + 1, r);
            return Merge(l1, l2);
        }
        return NULL;
    }
};