https://leetcode-cn.com/problems/kth-largest-element-in-an-array/
关键在于枢纽元的选择上,不能选择第一个,不然很慢。
class Solution {
public:
void quick(int l,int r,int k,vector<int>& nums){
if(l>=r)
return;
swap(nums[l],nums[(r+l)/2]);
int priot=nums[l];
int i=l,j=r;
while(i<j){
while(i<j && nums[j]>=priot){
j--;
}
swap(nums[i],nums[j]);
while(i<j && nums[i]<=priot){
i++;
}
swap(nums[i],nums[j]);
}
nums[i]=priot;
if(i<k){
quick(i+1,r,k,nums);
}
else if(i>k){
quick(l,i-1,k,nums);
}
else
return;
}
int findKthLargest(vector<int>& nums, int k) {
quick(0,nums.size()-1,nums.size()-k,nums);
//sort(nums.begin(),nums.end());
return nums[nums.size()-k];
}
};
堆,1.父节点大于等于子节点 2.递归
建堆:由小到大
class Solution {
public:
void move_down(vector<int>& nums,int root,int n){
int father=root;
while(2*father+1<n){
int son=2*father+1;
int son2=son+1;
if(son2<n && nums[son2]>nums[son])
son=son2;
if(nums[father]<nums[son]){
swap(nums[father],nums[son]);
}
father=son;
}
}
void build_heap(vector<int>& nums){
int n=nums.size();
for(int i=n/2;i>=0;i--){
move_down(nums,i,n);
}
}
int findKthLargest(vector<int>& nums, int k) {
int n=nums.size();
build_heap(nums);
for(int i=0;i<k;i++){
swap(nums[0],nums[n-1-i]);
move_down(nums,0,n-i-1);
}
return nums[n-k];
}
};