-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeKSortedArray.java
More file actions
48 lines (46 loc) · 1.42 KB
/
Copy pathMergeKSortedArray.java
File metadata and controls
48 lines (46 loc) · 1.42 KB
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
import java.util.PriorityQueue;
import java.util.Arrays;
public class MergeKSortedArray{
public int[] mergeKSortedArray(int[][] arr){
PriorityQueue<ArrayContainer> pq = new PriorityQueue<ArrayContainer>();
int length = 0;
for(int i = 0; i < arr.length; i++){
pq.add(new ArrayContainer(arr[i]));
length += arr[i].length;
}
int[] result = new int[length];
for(int i = 0; i < length; i++){
ArrayContainer ac = pq.poll();
result[i] = ac.arr[ac.index];
if(ac.index < ac.arr.length - 1){
ac.index ++;
pq.add(ac);
}
}
return result;
}
public static void main(String[] args) {
int[] arr1 = { 1, 3, 5, 7 };
int[] arr2 = { 2, 4, 6, 8 };
int[] arr3 = { 0, 9, 10, 11 };
MergeKSortedArray ms = new MergeKSortedArray();
int[] result = ms.mergeKSortedArray(new int[][] { arr1, arr2, arr3 });
System.out.println(Arrays.toString(result));
}
}
class ArrayContainer implements Comparable<ArrayContainer>{
int[] arr;
int index;
public ArrayContainer(int[] arr){
this.arr = arr;
index = 0;
}
public int compareTo(ArrayContainer o){
if(arr[index] < o.arr[o.index])
return -1;
else if(arr[index] > o.arr[o.index])
return 1;
else
return 0;
}
}