题目描述:
合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
示例:
输入:
[
1->4->5,
1->3->4,
2->6
]
输出: 1->1->2->3->4->4->5->6
算法1:
暴力法:
将所有的节点放在一个数组中,然后对数组排序,最后遍历数组,组建新的链表。
/**
* 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*>ans;
for(int i=0; i<lists.size(); i++) // 将链表节点放入数组中
{
ListNode *head = lists[i];
while(head!=NULL)
{
ans.push_back(head);
head = head->next;
}
}
sort(ans.begin(), ans.end(), cmp); // 对数组排序
ListNode *head = new ListNode(0);
ListNode *p = head;
for(int i=0; i<ans.size(); i++) // 构建链表
{
p->next = new ListNode(0);
p = p->next;
p->val = ans[i]->val;
}
p = head->next;
delete head;
return p;
}
static bool cmp(ListNode *a, ListNode* b)
{
return a->val < b->val;
}
};
算法2:
第1个链表和第2个链表合并,然后合成的新的链表再和第3个链表合并,依次类推......
/**
* 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) {
int size = lists.size();
if(size ==0 )
return NULL;
if(size == 1)
return lists[0];
ListNode *head1 = lists[0];
for(int i=1; i<size; i++) // 链表两两合并
{
ListNode *head2 = lists[i];
head1 = MergeTwoList(head1, head2);
}
return head1;
}
ListNode * MergeTwoList( ListNode *head1, ListNode *head2) //两个链表合并
{
ListNode *node = new ListNode(0);
ListNode *p = node;
while(head1 && head2)
{
if(head1->val < head2->val)
{
p->next = head1;
p=p->next;
head1 = head1->next;
}
else
{
p->next = head2;
p=p->next;
head2 = head2->next;
}
}
if(head1)
p->next = head1;
if(head2)
p->next = head2;
head1 = node->next;
delete node;
return head1;
}
};