分治大法
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
//合并两个
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode temp_head(0); //临时头结点
ListNode *pre=&temp_head;
while(l1&&l2){
if(l1->val<l2->val){
pre->next=l1;
l1=l1->next;
}else{
pre->next=l2;
l2=l2->next;
}
pre=pre->next;
}
if(l1){
pre->next=l1;
}
if(l2){
pre->next=l2;
}
return temp_head.next;
}
//合并k个
ListNode* mergeKLists(vector<ListNode*>& lists) {
if(lists.size()==0) return NULL;
if(lists.size()==1) return lists[0];
if(lists.size()==2) return mergeTwoLists(lists[0],lists[1]);
int mid=lists.size()/2;
vector<ListNode*> sub1_Lists;
vector<ListNode*> sub2_Lists;
for(int i=0;i<mid;i++){
sub1_Lists.push_back(lists[i]);
}
for(int i=mid;i<lists.size();i++){
sub2_Lists.push_back(lists[i]);
}
ListNode *l1=mergeKLists(sub1_Lists);
ListNode *l2=mergeKLists(sub2_Lists);
return mergeTwoLists(l1,l2);
}
};