题目
在数组中寻找第K大的数
样例
样例 1:
输入:
n = 1, nums = [1,3,4,2]
输出:
4
样例 2:
输入:
n = 3, nums = [9,3,2,4,8]
输出:
4
挑战
要求时间复杂度为O(n),空间复杂度为O(1)。
class Solution {
public:
/*
* param k : description of k
* param nums : description of array and index 0 ~ n-1
* return: description of return
*/
int kthLargestElement(int k, vector<int> nums) { //亮点1:【vector的使用】
if (nums.size() == 0 || k < 1 || k > nums.size()){ //
return -1;
}
return partition(nums, 0, nums.size() - 1, nums.size() - k);
}
private:
int partition(vector<int> &nums, int start, int end, int k) {
if (start >= end) {
return nums[k];
}
int left = start, right = end;
int pivot = nums[(start + end) / 2];
while (left <= right) {
while (left <= right && nums[left] < pivot) {
left++;
}
while (left <= right && nums[right] > pivot) {
right--;
}
if (left <= right) {
swap(nums, left, right);
left++;
right--;
}
}
if (k <= right) {
return partition(nums, start, right, k); //只需查找第K大的数所在的部分段
}
if (k >= left) {
return partition(nums, left, end, k);
}
return nums[k];
}
void swap(vector<int> &nums, int i, int j) {
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
};