23. Merge k Sorted Lists
Total Accepted: 86169
Total Submissions: 365909
Difficulty: Hard
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
主要思路:
题目其实挺简单的,只要合并时尽量像mergesort一样就行了。只是不知道为什么运行速度打败了几乎100%的其他答案。。。总而言之有点小兴奋就贴个代码冷静一下。
代码:
/**
* 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) {
vector<ListNode*>:: size_type len = lists.size();
if(!len)
return NULL;
while(len!=1)
{
int mid = len>>1;
for(int i=0;i<mid;i++)
lists.at(i) = merge(lists.at(i),lists.at(len-i-1));
len = (len&1) ? mid+1 : mid;
}
return lists[0];
}
ListNode* merge(ListNode* L1,ListNode* L2)
{
ListNode* l = L1;
ListNode* r = L2;
ListNode L(0),*P = &L;
while(l && r)
{
if(l->val < r->val)
{
P->next = l;
l = l->next;
}
else
{
P->next = r;
r = r->next;
}
P = P->next;
}
P->next = (l==NULL) ? r : l;
return L.next;
}
};