class Solution {
public int findKthLargest(int[] nums, int k) {
Queue<Integer> pq = new PriorityQueue<>();
for(int i = 0; i < nums.length; i++) {
pq.add(nums[i]);
if(pq.size() > k) {
pq.poll();
}
}
return pq.poll();
}
}
Kth Largest Element in an Array
最新推荐文章于 2024-09-09 23:55:06 发布
