class Solution {
public int findKthLargest(int[] nums, int k) {
if(nums.length == 0){
return -1;
}
//建立小根堆
PriorityQueue<Integer> minheap = new PriorityQueue<>((V1,V2)->V1-V2);
/**
//插入数
for(int num :nums){
minheap.add(num);
if(minheap.size()>k){
minheap.poll();
}
}
return minheap.peek();
**/
//先插入k个数
for(int i = 0 ;i < k;i++){
minheap.add(nums[i]);
}
for(int j = k;j<nums.length;j++){
if(nums[j]>minheap.peek()){
minheap.poll();
minheap.add(nums[j]);
}
}
return minheap.peek();
}
}
