-
Notifications
You must be signed in to change notification settings - Fork 0
/
023.cpp
165 lines (136 loc) · 2.61 KB
/
023.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
#include <iostream>
#include <vector>
using namespace std;
typedef struct ListNode
{
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
}ListNode;
class Solution
{
public:
ListNode* mergeKLists(vector<ListNode*>& lists)
{
int size = lists.size();
if(size == 0)
return NULL;
if(size == 1)
return lists[0];
int left = 0;
int right = size - 1;
return MergeAll(lists, left, right);
}
ListNode* MergeTwoLists(ListNode* list1, ListNode* list2)
{
ListNode* tail = new ListNode(0);
ListNode* head = tail;
while(list1 && list2)
{
if(list1->val > list2->val)
{
tail->next = list2;
list2 = list2->next;
}
else
{
tail->next = list1;
list1 = list1->next;
}
tail = tail->next;
}
if(list1)
tail->next = list1;
else
tail->next = list2;
tail = head;
head = head->next;
delete tail;
return head;
}
ListNode* MergeAll(vector<ListNode*>& lists, int left, int right)
{
if(left == right)
return lists[left];
int middle = (left + right) / 2;
ListNode* head1 = MergeAll(lists, left, middle);
ListNode* head2 = MergeAll(lists, middle + 1, right);
return MergeTwoLists(head1, head2);
}
ListNode * BuildList(vector<int>& nums)
{
ListNode * head = NULL;
int size = nums.size();
if(size == 0)return head;
ListNode* tail = NULL;
for(int i = 0; i < size; i++)
{
if(head == NULL)
{
head = new ListNode(nums[i]);
tail = head;
}
else
{
ListNode * node = new ListNode(nums[i]);
tail->next = node;
tail = node;
}
}
tail->next = NULL;
return head;
}
void Output(ListNode* head)
{
while(head)
{
cout << head->val << endl;
head = head->next;
}
return ;
}
};
void test()
{
Solution s;
vector<int> nums1;
vector<int> nums2;
vector<int> nums3;
vector<int> nums4;
vector<int> nums5;
nums1.push_back(1);
nums1.push_back(3);
nums1.push_back(10);
nums2.push_back(2);
nums2.push_back(3);
nums2.push_back(5);
nums2.push_back(6);
nums3.push_back(1);
nums3.push_back(2);
nums3.push_back(7);
nums4.push_back(3);
nums4.push_back(4);
nums4.push_back(5);
nums5.push_back(7);
nums5.push_back(8);
nums5.push_back(9);
vector<ListNode*> lists;
ListNode* list1 = s.BuildList(nums1);
ListNode* list2 = s.BuildList(nums2);
ListNode* list3 = s.BuildList(nums3);
ListNode* list4 = s.BuildList(nums4);
ListNode* list5 = s.BuildList(nums5);
lists.push_back(list1);
lists.push_back(list2);
lists.push_back(list3);
lists.push_back(list4);
lists.push_back(list5);
ListNode* head = s.mergeKLists(lists);
s.Output(head);
}
int main()
{
test();
system("pause");
return 1;
}