首页 > 其他 > 详细

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

时间:2015-09-08 15:12:08      阅读:237      评论:0      收藏:0      [点我收藏+]

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

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!