215. Kth Largest Element in an Array
Medium
2280188FavoriteShare
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
Example 1:
Input: [3,2,1,5,6,4]
and k = 2
Output: 5
Example 2:
Input: [3,2,3,1,2,4,5,5,6]
and k = 4
Output: 4
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
int Length = nums.size();
if(k < 0 || k > Length){return 0;}
priority_queue<int,vector<int>,greater<int>> pri;//小顶堆
for(int i = 0;i < k;i ++){
pri.push(nums[i]);
}
for(int i = k;i < nums.size();i ++){
if(nums[i] > pri.top()){
pri.pop();
pri.push(nums[i]);
}
}
return pri.top();
}
};