無序數組求第K大數

int findKthLargest(int []nums, int k) { int m = nums.length; k = m - k; return helper(nums, 0, m - 1, k); } int helper(int []nums, int left, int right, int k) { i

>>阅读原文<<