第五题 Kth Largest Element 算法

Kth Largest Element

Description
Find the K-th largest element in an array.

public class Solution {
    /**
     * @param k: An integer
     * @param nums: An array
     * @return: the Kth largest element
     */
    public int kthLargestElement(int k, int[] nums) {
        // write your code here
        if (nums == null){
            return -1 ;
        }

        return quickSelect(nums , 0 , nums.length-1, k) ;
    }
     public int quickSelect(int[] nums , int start , int end , int k) {
         if(start == end){
             return nums[start];     //递归出口
         }
         int left = start;
         int right = end ;
         int pivot =nums[ (start + end)/2]  ;
         //int count=0 ;
         while(left <= right){
             while(left <= right && nums[left] > pivot ){
                 left++ ;
             }
             while(left <= right && nums[right] < pivot){
                 right-- ;
             }
             if(left <= right){
                 int temp = nums[left];
                 nums[left] = nums[right];
                 nums[right] = temp ;
                 left++ ;
                 right-- ;
             }
         }
         
         //for (int i= 0 ; i < nums.length ; i++){
           //  count++ ;
             //if(nums[i] == k){
               //  break ;
             //}
         //}
         //return count ; 
         if(start+k-1 <= right){       //第一种情况 在R的左侧
            return quickSelect(nums , start , right, k) ;
         }
         if(start+k-1 >= left){           //第二种情况  在L的右侧
            return quickSelect(nums , left , end, k-(left-start)) ;
         }
        //return  nums[k-1] ;
        return  nums[right+1] ;        //第三种情况 正好在R L 之间
     }
}