题目
Merge
k
sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
/**
* 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) {
}
};
思路
分治算法。
代码
class Solution {
public:
ListNode* mergeKLists(vector<ListNode*>& lists) {
int leng = lists.size();
if (leng == 0) {
return NULL;
}
while (lists.size() > 1){
lists.push_back(mergeList(lists[0], lists[1]));
lists.erase(lists.begin());
lists.erase(lists.begin());
}
return lists.front();
}
ListNode *mergeList(ListNode *l1, ListNode *l2) {
ListNode *head = new ListNode(NULL);
ListNode *p1 = head;
ListNode *follow = head;
if (l1 == NULL) {
return l2;
}
if (l2 == NULL) {
return l1;
}
while (l1 != NULL && l2 != NULL) {
if (l1->val < l2->val) {
p1->val = l1->val;
l1 = l1->next;
}
else {
p1->val = l2->val;
l2 = l2->next;
}
p1->next = new ListNode(NULL);
follow = p1;
p1 = p1->next;
}
if (l1 == NULL) {
if (l2 != NULL) {
follow->next = l2;
}
else {
return head;
}
}
if (l2 == NULL) {
if (l1 != NULL) {
follow->next = l1;
}
else {
return head;
}
}
return head;
}
};