Leetcode之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.

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.

代码：

class Solution {
public:
    int find(vector<int>& nums, int k, int start, int end) {
	if (start >= end)return nums[start];
	int i = start, j = end, temp = nums[start];
	while (i < j) {
		while (i<j && nums[j]>temp)j--;
		if (i >= j)break;
		nums[i] = nums[j]; i++;
		while (i < j && nums[i] < temp)i++;
		if (i >= j)break;
		nums[j] = nums[i]; j--;
	}
	nums[i] = temp;
	if (end + 1 - i > k) {
	  return find(nums, k, i + 1, end);
	}
	else if (end + 1 - i < k) {
		return find(nums, k-(end-i+1), start, i - 1);
	}
	else return nums[i];
}
int findKthLargest(vector<int>& nums, int k) {
	int len = nums.size();
	return find(nums, k, 0, len - 1);
}
};