数组中的第K个最大元素

public int findKthLargest(int[] nums, int k) {
    quickSort(nums,0,nums.length-1);
    return nums[k-1];
}

public void quickSort(int[] nums,int left,int right){
    if(left>=right){
        return;
    }
    int pivot = nums[right];
    int i = left-1;
    for(int j=left;j<right;j++){
        if(nums[j]>pivot){
            i++;
            int temp = nums[j];
            nums[j] = nums[i];
            nums[i] = temp;
        }
    }
    int pivotIndex = i+1;
    int temp = nums[right];
    nums[right] = nums[pivotIndex];
    nums[pivotIndex] = temp;
    quickSort(nums,left,pivotIndex-1);
    quickSort(nums,pivotIndex+1,right);
}