java
快排
然后返回len-k
class Solution {
public void qsort(int[] nums,int low ,int high) {
if(low<high) {
int l=low;
int r=high;
int key=nums[l];
while(l<r) {
while(l<r&&key<=nums[r])
--r;
nums[l]=nums[r];
while(l<r&&key>=nums[l])
++l;
nums[r]=nums[l];
}
nums[l]=key;
qsort(nums, low, l-1);
qsort(nums, r+1, high);
}
}
public int findKthLargest(int[] nums, int k) {
qsort(nums, 0, nums.length-1);
return nums[nums.length-k];
}
}