LeetCode 之 Kth Largest Element in an Array — C++ 实现
来源:互联网 发布:淘宝上买东西怎样付款 编辑:程序博客网 时间:2024/05/02 02:45
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.
例如,
给定数组 [3,2,1,5,6,4] 和 k = 2,返回 5。
分析:
将数组元素从大到小排序,返回第 k-1 个元素即可。
class Solution {public: int findKthLargest(vector<int>& nums, int k) { sort(nums.begin(), nums.end(), cmp); return nums[k-1]; } static bool cmp(int first, int second) { return (first > second); }};
0 0
- LeetCode 之 Kth Largest Element in an Array — C++ 实现
- 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
- 46.求1+2+3+......+n
- AIX系统维护手册二.双机配置,HACMP
- NYOJ 458 解题报告
- 八数码问题之哈希优化
- html学习笔记(5)
- LeetCode 之 Kth Largest Element in an Array — C++ 实现
- C++ 链表实现通讯录 (关于获取鼠标句柄后,清屏不能再次获取)
- 关于Java SE、Java EE、Java ME三者的认识
- 基于power supply信息传递的uevent机制
- php导出word文档样式,与需求给你的word文档一模一样。
- Node.js 之基于文件的模块系统
- Cocos Studio工程分析
- android 改变ImageView的颜色(Alpha值、Red值、Green值、Blue值)
- 原路归并排序