/
MergeKSortedLists.java
46 lines (42 loc) · 1.27 KB
/
MergeKSortedLists.java
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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
// https://leetcode.com/problems/merge-k-sorted-lists/
class Solution {
public ListNode mergeKLists(ListNode[] lists) {
ListNode res = new ListNode(), r = res, t = null;
while (true) {
int min = Integer.MAX_VALUE, minIndex = -1;
for (int i = 0; i < lists.length; i++) {
if (lists[i] != null) {
if (lists[i].val < min) {
min = lists[i].val;
minIndex = i;
}
}
}
if (minIndex != -1) {
res.val = min;
lists[minIndex] = lists[minIndex].next;
res.next = new ListNode();
t = res;
res = res.next;
} else {
if (t != null) {
t.next = null;
} else {
r = null;
}
break;
}
}
return r;
}
}