Kth Largest Element in a Stream LeetCode solution in Java

1
class KthLargest {
2
  PriorityQueue<Integer> queue = new PriorityQueue();
3
  int k = 0;
4

5
  public KthLargest(int k, int[] nums) {
6
    this.k = k;
7
    for (int i : nums) add(i);
8
  }
9

10
  public int add(int val) {
11
    if (k > queue.size()) queue.add(val);
12
    else if (val > queue.peek()) {
13
      queue.poll();
14
      queue.add(val);
15
    }
16
    return queue.peek();
17
  }
18
}