-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
703.java
106 lines (86 loc) · 2.53 KB
/
703.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
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
__________________________________________________________________________________________________
sample 52 ms submission
class KthLargest {
int k;
int[] heap;
public KthLargest(int k, int[] nums) {
int size = Math.min(k, nums.length);
this.k = k;
heap = new int[k];
for(int i = 0; i < size; i++) {
heap[i] = nums[i];
}
// dummy value
if (size < k) {
heap[k-1] = Integer.MIN_VALUE;
}
buildMinHeap(heap);
// if size > k
for (int i = k; i < nums.length; i++) {
add(nums[i]);
}
}
private void buildMinHeap(int[] heap) {
int half = (k/2) - 1;
for (int i = half; i >= 0; i--) {
heapify(i, heap);
}
}
private void heapify(int i, int[] heap) {
int leftIndex = 2 * i + 1;
int rightIndex = 2 * i + 2;
int lowest = i;
if (leftIndex < k && heap[leftIndex] < heap[lowest]) {
lowest = leftIndex;
}
if (rightIndex < k && heap[rightIndex] < heap[lowest]) {
lowest = rightIndex;
}
if (lowest != i) {
swap(heap, i, lowest);
heapify(lowest, heap);
}
}
private void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public int add(int val) {
if (val > heap[0]) {
heap[0] = val;
heapify(0, heap);
}
return heap[0];
}
}
/**
* Your KthLargest object will be instantiated and called as such:
* KthLargest obj = new KthLargest(k, nums);
* int param_1 = obj.add(val);
*/
__________________________________________________________________________________________________
sample 41412 kb submission
class KthLargest {
private PriorityQueue<Integer> pq = new PriorityQueue<>();
private Integer limit = -1;
public KthLargest(int k, int[] nums) {
limit = k;
for (int n : nums) {
pq.offer(n);
if (pq.size() > limit)
pq.poll();
}
}
public int add(int val) {
pq.offer(val);
if (pq.size() > limit) pq.poll();
return pq.peek();
}
}
/**
* Your KthLargest object will be instantiated and called as such:
* KthLargest obj = new KthLargest(k, nums);
* int param_1 = obj.add(val);
*/
__________________________________________________________________________________________________