215. Kth Largest Element in an Array

标签：int   length   end   sorted   sort   ndk   problem   sum   思路   

Problem:

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Example 1:

Input: [3,2,1,5,6,4] and k = 2
Output: 5
Example 2:

Input: [3,2,3,1,2,4,5,5,6] and k = 4
Output: 4
Note:
You may assume k is always valid, 1 ≤ k ≤ array‘s length.

思路：

Solution (C++):

int findKthLargest(vector<int>& nums, int k) {
    int n = nums.size();
    sort(nums.begin(), nums.end());
    return nums[n-k];
}

性能：

Runtime: 8 ms??Memory Usage: 6.8 MB

思路：

Solution (C++):

性能：

Runtime: ms??Memory Usage: MB

215. Kth Largest Element in an Array

标签：int   length   end   sorted   sort   ndk   problem   sum   思路   

原文地址：https://www.cnblogs.com/dysjtu1995/p/12598859.html