本文共 378 字,大约阅读时间需要 1 分钟。
public int portition(int[] nums,int left,int right) { int key = nums[left]; int i = left; int j = right; while(ikey) { if(nums[i] right) return -1; int pos = portition(nums,left,right); if(pos-left+1 == k) return nums[pos]; else if(pos-left+1 < k) { return findKth(nums,pos+1,right,k-(pos-left+1)); }else { return findKth(nums,left,pos-1,k); } }
转载地址:http://rvgdb.baihongyu.com/