215. 数组中的第K个最大元素/C++

利用快速排序的二分技术

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        int low=0,mid=0,high=nums.size()-1;
        while(low<=high){
            mid=partation(nums,low,high);
            if(mid==k-1) return nums[mid];
            else if(mid>k-1) high=mid-1;
            else low=mid+1;
        }
        return -1;
    }
    //返回[++++====----]
    //返回        ^返回与枢轴相等的最后一个
    int partation(vector<int>& nums,int start,int end){
        int left=start,right=end;
        swap(nums[left],nums[(left+right)/2]);//以中间的值为枢轴，可以加快效率
        int pivot=nums[left];
        while(left<right){
            while(left<right && nums[right]<pivot) --right;
            if(left<right) nums[left++]=nums[right];
            while(left<right && nums[left]>=pivot) ++left;
            if(left<right) nums[right--]=nums[left];
        }
        nums[left]=pivot;
        return left;
    }
};

小顶堆

int findKthLargest(vector<int>& nums, int k) {
    priority_queue<int, vector<int>, greater<int>> minHeap;
    for (auto e : nums) {
        if (minHeap.size() == k) {
            if (e < minHeap.top()) continue;
            minHeap.pop();
        }
        minHeap.push(e);
    }
    return minHeap.top();
}