215 Kth Largest Element in an Array

Leetcode

Given an integer array nums and an integer k, return the kth largest element in the array.

Note that it is the kth largest element in the sorted order, not the kth distinct element.

Example 1:

Input: nums = [3,2,1,5,6,4], k = 2
Output: 5

Example 2:

Input: nums = [3,2,3,1,2,4,5,5,6], k = 4
Output: 4

---

使用优先队列（堆），时间复杂度 o(log n * log k)

public int findKthLargest(int[] nums, int k) {
    PriorityQueue<Integer> pq=new PriorityQueue<>();
    for(int i=0;i<nums.length;++i){
        pq.add(nums[i]);
        if(i>=k) pq.poll();
    }
    return pq.peek();
}