链接: https://leetcode-cn.com/problems/kth-largest-element-in-an-array/
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
sort(nums.begin(),nums.end());
int n=nums.size();
return nums[n-k];
}
};
链接: https://leetcode-cn.com/problems/kth-largest-element-in-an-array/
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
sort(nums.begin(),nums.end());
int n=nums.size();
return nums[n-k];
}
};