LeetCode:Kth Largest Element in an Array(need update)

标签：

problem:

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.

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

solution 1:

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

LeetCode:Kth Largest Element in an Array(need update)

标签：

原文地址：http://www.cnblogs.com/xiaoying1245970347/p/4791648.html