#215. Kth Largest Element in an Array

Posted 2020-10-12 东方春

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        return findInner(nums, 0, nums.size()-1,k);
    }
    
    
    int findInner(vector<int>& nums, int iLeft,int iRight,int k){
        if(iRight == iLeft)  return nums[iLeft];
        int idx = rand()%(iRight - iLeft + 1) + iLeft;
        int pivot = nums[idx];
        nums[idx] = nums[iLeft];
        int iBegin = iLeft;
        int iEnd = iRight;
        
        while (iBegin < iEnd) {
               while (iBegin < iEnd && nums[iEnd] <= pivot) {
                     iEnd--;
               }
               nums[iBegin] = nums[iEnd];
               while (iBegin < iEnd && nums[iBegin] >= pivot) {
                     iBegin++;
               }
               nums[iEnd] = nums[iBegin];
        }
        nums[iBegin] = pivot; //iBegin == iEnd

        //divide and  conquer
        int iLeftPartNum = iBegin - iLeft;
        if(iLeftPartNum == k - 1)
               return nums[iBegin];
        else if(iLeftPartNum > k - 1){
              return findInner( nums, iLeft,iBegin-1, k);
        }
        else if(iLeftPartNum < k - 1){
              return findInner( nums,iBegin+1, iRight, k-(iLeftPartNum+1));
        }
        
        
        
    }
};