Description：
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.
你确定你不是在逗我？
public class Solution {
public int findKthLargest(int[] nums, int k) {
Arrays.sort(nums);
return nums[nums.length - k];
}
}
LeetCode——Kth Largest Element in an Array
原文：http://www.cnblogs.com/wxisme/p/4601146.html