Kth Largest Element in an Array
思路很直接，建立大根堆，然后依次弹出就好。
class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
//k总是有效，那么nums非空
int result = 0;
make_heap(nums.begin(),nums.end());
while(k > 0)
{
pop_heap(nums.begin(),nums.end());
result = nums.back();
nums.pop_back();
--k;
}
return result;
}
};
215. Kth Largest Element in an Array Find the kth largest...
215. Kth Largest Element in an Array
分类：分治 215. Kth Largest Element in an Array Find the kth l...
LeetCode 215. Kth Largest Element in an Array Description...
215. Kth Largest Element in an Array Pick One Find the kt...
215. Kth Largest Element in an Array 要找第K大的数，就是找第len(nums...
https://leetcode.com/problems/kth-largest-element-in-an-a...
利用快速排序分区方法，深入理解return findXth(nums+index+1, numsSize-inde...
Question Find the kth largest element in an unsorted arra...
Kth Largest Element in an Array思路很直接，建立大根堆，然后依次弹出就好。
本文标题：215. Kth Largest Element in an A
本文链接：https://www.haomeiwen.com/subject/odhgrttx.html
网友评论