花花酱 LeetCode 215. Kth Largest Element in an Array

Given an integer array nums and an integer k, return the k^th largest element in the array.

Note that it is the k^th largest element in the sorted order, not the k^th 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:

Solution: Quick selection

Time complexity: O(n)
Space complexity: O(1)

// Author: Huahua

class Solution {

public:

int findKthLargest(vector<int>& nums, int k) {

nth_element(nums.begin(), nums.begin() + k - 1, nums.end(), std::greater<int>());

return nums[k - 1];

}

};

请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.

Buy anything from Amazon to support our website
您可以通过在亚马逊上购物（任意商品）来支持我们

Paypal

Venmo
huahualeetcode

微信打赏