Leetcode114: Kth Largest Element in an Array

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.

For example,

Given

[3,2,1,5,6,4]

and k = 2, return 5.

Note:

You may assume k is always valid, 1 ≤ k ≤ array's length.

Credits:

Special thanks to @mithmatt for adding this problem and creating all test cases.

O(n)解法：快速选择（QuickSelect）算法，参考耶鲁大学关于QuickSelect算法的介绍

O(nlogn)解法：排序

class Solution {
public:
int findKthLargest(vector<int>& nums, int k) {
int n = nums.size();
vector<int> left;
vector<int> right;
for(int i = 1; i < n; i++)
{
if(nums[i]>nums[0])
right.push_back(nums[i]);
else
left.push_back(nums[i]);
}
int m = right.size();
if(m >= k)
return findKthLargest(right, k);
else if(m == k-1)
return nums[0];
else
return findKthLargest(left, k-m-1);
}
};