215. Kth Largest Element in an Array (have better solution )

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.

Solution 1:

1 class Solution {
2 public:
3     int findKthLargest(vector<int>& nums, int k) {
4         int n=nums.size();
5         sort (nums.begin(),nums.end());
6         return nums[n-k];
7     }
8 };

215. Kth Largest Element in an Array (have better solution )

原文：http://www.cnblogs.com/anghostcici/p/6668983.html