LeetCode 215. Kth Largest Element in an Array（第K大元素）

原题网址：https://leetcode.com/problems/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.

For example,
Given [3,2,1,5,6,4] and k = 2, return 5.

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

方法一：排序，然后直接根据位置得到。

public class Solution {
    public int findKthLargest(int[] nums, int k) {
        Arrays.sort(nums);
        return nums[nums.length-k];
    }
}

方法二：使用最大堆。

public class Solution {
    public int findKthLargest(int[] nums, int k) {
        PriorityQueue<Integer> heap = new PriorityQueue<>();
        for(int num: nums) {
            heap.offer(num);
            if (heap.size() > k) heap.poll();
        }
        return heap.poll();
    }
}

方法三：使用类似快速排序法，此处省略。