排序算法 快速选择 215. Kth Largest Element in an Array

Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in the sorted order, not the kth distinct element.
Example 1:
Input: nums = [3,2,1,5,6,4], k = 2
Output: 5
Example 2:
Input: nums = [3,2,3,1,2,4,5,5,6], k = 4
Output: 4
Constraints:
1 <= k <= nums.length <= 104
-104 <= nums[i] <= 104

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        sort(nums.begin(),nums.end());
        return nums[nums.size()-k];
    }
};

直接调用了我意思
哈哈还是自己写一个练练

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        quick_sort(nums, 0, nums.size());
        return nums[nums.size()-k];
    }
    void quick_sort(vector<int> &nums, int l, int r){
        if(l+1 >= r)
            return;
        int low = l, high = r-1, key = nums[l];
        while(low < high){
            while(low < high && nums[high] >= key){
                high--;
            }
            nums[low] = nums[high];
            while(low < high && nums[low] <= key){
                low++;
            }
            nums[high] = nums[low];
        }
        nums[low] = key;
        quick_sort(nums,l,low);
        quick_sort(nums,low+1,r);
    }
};