找出数组中第K大元素

1. 基于快速排序实现

#include <iostream>
#include<vector>
using namespace std;

int partition(vector<int>& array, int left, int right){

    int povit = array[right];  // 选择最右的元素作为基准值
    int i = left, j = right -1;
    while (i <= j){
        if (array[i] <= povit){
            i++;
        }
        else if (array[j] > povit){
            j--;
        }
        else{
            swap(array[i], array[j]);
        }
    }
    swap(array[i], array[right]);

    return i;
}
// 使用快速排序思想
int findKthLargest(vector<int>& nums, int k) {
    int targetIndex = nums.size() - k;  // 计算第K大元素在升序数组中的索引
    int left = 0, right = nums.size() - 1;
    while(left <= right){
        // 当前基准值索引
        int curIndex = partition(nums, left, right);
        if (curIndex == targetIndex){
            cout<< nums[curIndex]<<endl;
            return 0;
        }
        else if (curIndex < targetIndex){
            left = curIndex + 1;
        }
        else {
            right = curIndex - 1;
        }
    }
    return 0;
}

int main()
{   vector<int> arr={9,8,7,6,5,4,3,2,1};
    findKthLargest(arr,3);
    cout << "Hello world!" << endl;
    return 0;
}

2. 基于小顶堆实现

#include <iostream>
#include<vector>
#include<queue>
using namespace std;
int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int, vector<int>, greater<int>> Q;
        for(auto &num: nums){
            if(Q.size()==k){
                if(num>Q.top()){
                    Q.pop();
                    Q.push(num);
                }
            }
            else{
                Q.push(num);
            }
        }
        cout<<Q.top()<<endl;
        return 0;
}
int main()
{   vector<int> arr={9,8,7,6,5,4,3,2,1};
    findKthLargest(arr,3);
    cout << "Hello world!" << endl;
    return 0;
}