(LeetCode) 215. Kth Largest Element in an Array
来源:互联网 发布:linux 查看路由 编辑:程序博客网 时间:2024/06/11 10:15
215. Kth Largest Element in an Array
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) { int size = nums.size(); if (size == 0 || k >size) return -1; nth_element(nums.begin(), nums.end() -k, nums.end()); // since the element i want is in nums.end() -k position return nums[size-k]; }};
阅读全文
0 0
- Leetcode Kth Largest Element in an Array
- Leetcode: Kth Largest Element in an Array
- LeetCode Kth Largest Element in an Array
- [LeetCode] Kth Largest Element in an Array
- [leetcode] Kth Largest Element in an Array
- leetcode--Kth Largest Element in an Array
- #leetcode#Kth Largest Element in an Array
- LeetCode Kth Largest Element in an Array
- 【Leetcode】Kth Largest Element in an Array
- Leetcode: Kth Largest Element in an Array
- Kth Largest Element in an Array -- leetcode
- [Leetcode]Kth Largest Element in an Array
- [LeetCode]Kth Largest Element in an Array
- *LeetCode-Kth Largest Element in an Array
- LeetCode----Kth Largest Element in an Array
- LeetCode Kth Largest Element in an Array
- leetcode-Kth Largest Element in an Array
- LeetCode -- Kth Largest Element in an Array
- 欢迎使用CSDN-markdown编辑器
- 奇数前进
- 二值图像处理闭运算
- 机器学习实现bayes
- 2017年河南省ACM省赛 Problem C: 最小秘钥
- (LeetCode) 215. Kth Largest Element in an Array
- java面向对象的特征
- nginx+iis实现负载均衡
- LBaas之(五) Liberty版本Neutron LBaas实现分析
- Angular 首屏加载优化
- JavaScript同步与异步之异步进化史
- JSP 导入CSS样式无效
- 搜索练习题D-04
- 分布式和集群