码迷,mamicode.com
首页 > 其他好文 > 详细

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

时间:2017-04-05 16:28:49      阅读:152      评论:0      收藏:0      [点我收藏+]

标签:int   distinct   style   for   ica   back   not   vector   and   

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 )

标签:int   distinct   style   for   ica   back   not   vector   and   

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

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!