703. Kth Largest Element in a Stream

703. Kth Largest Element in a Stream

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.

Your KthLargest class will have a constructor which accepts an integer k and an integer array nums, which contains initial elements from the stream. For each call to the method KthLargest.add, return the element representing the kth largest element in the stream.

Example:

int k = 3;
int[] arr = [4,5,8,2];
KthLargest kthLargest = new KthLargest(3, arr);
kthLargest.add(3);   // returns 4
kthLargest.add(5);   // returns 5
kthLargest.add(10);  // returns 5
kthLargest.add(9);   // returns 8
kthLargest.add(4);   // returns 8

Note: You may assume that nums' length ≥ k-1 and k ≥ 1.

My Solutions:

维持一个大小为k的priority queue，pq.peek() or pq.poll()是最上面的最小数字，pq.offer(val)会加入新数字val，pq会自动维护从小到大排列

class KthLargest {
    
    PriorityQueue<Integer> pq;
    int k;
    
    public KthLargest(int k, int[] nums) {
        pq = new PriorityQueue<>();;
        this.k = k;
        
        for (int n : nums) add(n);
    }
    
    public int add(int val) {
        if (pq.size() < k) pq.offer(val);
        else if (pq.peek() < val){
            pq.poll();
            pq.offer(val);
        }
        return pq.peek();        
    }
}