215. Kth Largest Element in an Array

leecode215.java

class Solution {
    public int findKthLargest(int[] nums, int k) {
        PriorityQueue<Integer> maxHeap = new PriorityQueue<>();
        for(int num : nums){
            maxHeap.add(num);
            if(maxHeap.size()>k){
                maxHeap.poll();
            }
        }
        return maxHeap.poll();
    }
}

// Time ==> O(nlog(k)), n ==> arraysize, k heap size
// Sapce ==> O(k)