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) { //先排序，然后返回第k个值（从小到大排序） Arrays.sort(nums); return nums[nums.length-k]; } }
[leedcode 215] Kth Largest Element in an Array
原文：http://www.cnblogs.com/qiaomu/p/4709162.html