forked from algorithm001/algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode_703_134.java
More file actions
36 lines (32 loc) · 871 Bytes
/
Copy pathLeetCode_703_134.java
File metadata and controls
36 lines (32 loc) · 871 Bytes
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
//https://leetcode.com/problems/kth-largest-element-in-a-stream/
class KthLargest {
private PriorityQueue<Integer> queue;
private int ksize;
public KthLargest(int k, int[] nums) {
if (nums != null && k > 0) {
ksize = k;
queue = new PriorityQueue<>();
for (int n : nums) {
add(n);
}
}
}
public int add(int val) {
if (queue == null)
return 0;
if (queue.size() < ksize) {
queue.offer(val);
} else {
if (queue.peek() < val) {
queue.poll();
queue.offer(val);
}
}
return queue.peek();
}
}
/**
* Your KthLargest object will be instantiated and called as such:
* KthLargest obj = new KthLargest(k, nums);
* int param_1 = obj.add(val);
*/