LeetCode上的题:
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
分析:合并K个已排序的链表,实际上就是重复合并两个已排序的链表。
代码如下:
//Definition for singly-linked list.
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode *mergetwoLists(ListNode * list1,ListNode * list2){
ListNode * head1=NULL,*head2=NULL,*head=NULL;
if(list1==NULL)return list2;
if(list2==NULL)return list1;
if(list1->val<=list2->val)
{
head=head1=list1;
head2=list2;
}
else
{
head=head1=list2;
head2=list1;
}
while(head2!=NULL)
{
while(head1->next!=NULL&&head1->next->val<=head2->val)
{
head1=head1->next;
}
if(head1->next==NULL)
{
head1->next=head2;
break;
}
else
{
ListNode * tmp1=head1->next;
ListNode * tmp2=head2->next;
head1->next=head2;
head2->next=tmp1;
head1=head2;
head2=tmp2;
}
}
return head;
}
ListNode *mergeKLists(vector<ListNode *> &lists) {
// if(lists.size()<=0)return NULL;
// if(lists.size()==1)return lists[0];
ListNode *head=NULL;
for(int i=0;i<lists.size();i++)
{
head=mergetwoLists(lists[i],head);
}
return head;
}
};