Kth Largest Element in an Array

来源:互联网 发布:社交软件市场分析 编辑:程序博客网 时间:2024/06/06 04:39

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.


class Solution {public:    int findKthLargest(vector<int>& nums, int k) {        sort(nums.begin(), nums.end());          reverse(nums.begin(), nums.end());          return nums[k-1];      }};


0 0
原创粉丝点击