23. 合并K个排序链表/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.empty()) return NULL;
        return merge(lists,0,lists.size()-1);
    }
    ListNode* merge(vector<ListNode*>& lists,int left,int right) {
        if(left==right) return lists[left];
        int mid = left+(right-left)/2;
        ListNode* l1 = merge(lists,left,mid);
        ListNode* l2 = merge(lists,mid+1,right);
        return mergeTwoLists(l1,l2); 
    }
    ListNode* mergeTwoLists(ListNode* list1,ListNode* list2) {
        if(!list1) return list2;
        if(!list2) return list1;
        if(list1->val<list2->val){
            list1->next=mergeTwoLists(list1->next,list2);
            return list1;
        } 
        else{
            list2->next=mergeTwoLists(list1,list2->next);
            return list2;
        } 
    }
};