首页 > 代码库 > 215. Kth Largest Element in an Array (have better solution )
215. Kth Largest Element in an Array (have better solution )
<style>p.p1 { margin: 0.0px 0.0px 0.0px 0.0px; font: 14.0px "Helvetica Neue"; color: #323333 }
span.s1 { }
span.s2 { font: 13.0px Menlo; color: #c7254e; background-color: #f9f2f4 }</style>
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 )
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。