方法有很多种,下面代码是使用的分治思想,两两链表进行合并
/**
* 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;
int period = 1, length = lists.size();
while(period < length)
{
int cur = 0;
while(cur+period < length)
{
lists[cur] = mergeTowLists(lists[cur], lists[cur+period]);
cur=cur+2*period;
}
period *= 2;
}
return lists[0];
}
ListNode *mergeTowLists(ListNode* l1, ListNode* l2)
{
if(l1 == NULL) return l2;
if(l2 == NULL) return l1;
if(l1 -> val < l2 -> val)
{
l1->next = mergeTowLists(l1->next, l2);
return l1;
}
else
{
l2->next=mergeTowLists(l1, l2->next);
return l2;
}
}
};