Java—Leetcode 703 Kth Largest Element in a Stream

Description

Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Implement KthLargest class:

• KthLargest(int k, int[] nums) Initializes the object with the integer k and the stream of integers nums.
• int add(int val) Appends the integer val to the stream and returns the element representing the kth largest element in the stream.

Hints

Data Structure: Min Heap of Size K

Code

class KthLargest {
        final PriorityQueue<Integer> heap = new PriorityQueue<>();
        final int k;

        public KthLargest(int k, int[] nums) {
            this.k = k;
            for (int n : nums)
                add(n);
        }

        public int add(int val) {
            if (heap.size() < k)
                heap.offer(val);
            else if (val > heap.peek()) {
                heap.poll();
                heap.add(val);
            }
            return heap.peek();
        }
    }