215. Kth Largest Element in an Array 快速排序法,选择一个数,比这个数大的交换到左边,比这个数小的交换到右边. class Solution { public int findKthLargest(int[] nums, int k) { shuffle(nums); k = nums.length - k; int lo = 0, hi = nums.length - 1; while(lo < hi){ final int j = partition(nu…