还没回过神来,这道题就解决了,我也是醉了
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
sort(nums.begin(), nums.end());
reverse(nums.begin(), nums.end());
return nums[k - 1];
}
};
还没回过神来,这道题就解决了,我也是醉了
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
sort(nums.begin(), nums.end());
reverse(nums.begin(), nums.end());
return nums[k - 1];
}
};