215. Kth Largest Element in an Array

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Example 1:

Input: [3,2,1,5,6,4] and k = 2
Output: 5

Example 2:

Input: [3,2,3,1,2,4,5,5,6] and k = 4
Output: 4

Note: 
You may assume k is always valid, 1 ≤ k ≤ array's length.

 

求第K大的数

 

C++：快排思想

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        k = nums.size() - k ;
        int left = 0 ;
        int right = nums.size() - 1 ;
        while(left < right){
            int index = partation(nums,left,right) ;
            if (index == k){
                break ;
            }else if(index < k){
                left = index + 1 ;
            }else{
                right = index - 1 ;
            }
        }
        return nums[k] ;
    }
    
    int partation(vector<int>& nums, int left , int right) {
        int k = left ;
        for(int i = left ; i < right ; i++){
            if (nums[i] < nums[right]){
                swap(nums[k++] , nums[i]) ;
            }
        }
        swap(nums[k] , nums[right]) ;
        return k ;
    }
};

 

java: 最大堆  求第2大的数可以转化为求第5小的数

class Solution {
    public int findKthLargest(int[] nums, int k) {
        PriorityQueue<Integer> minHeap = new PriorityQueue<Integer>((o1,o2) -> o2-o1) ;
        k = nums.length-k+1 ;
        for(int num : nums){
            if (minHeap.size() < k){
                minHeap.add(num) ;
            }else if(minHeap.peek() > num){
                minHeap.poll() ;
                minHeap.add(num) ;
            }
        }
        return minHeap.peek() ;
    }
}