Leetcode:215. Kth Largest Element in an Array
来源：互联网 发布：知乎电影1942精彩片段 编辑：程序博客网 时间：2024/06/06 05:11
题意：即相当于第n - k +1大的数！
下面放出代码：
class Solution {public: int findKthLargest(vector<int>& nums, int k) { int L = 0, R = nums.size() - 1; while (L < R) { int left = L, right = R; int key = nums[left]; while (left < right) { while (left < right && nums[right] < key) --right; nums[left] = nums[right]; while (left < right && nums[left] >= key) ++left; nums[right] = nums[left]; } nums[left] = key; if (left == k - 1) return nums[k - 1]; else if (left > k - 1) R = left - 1; else L = left + 1; } return nums[k - 1]; }};算法：
仿照找第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
- 数据库探索之旅——数据库管理系统
- 在命令行下编译通过，运行时提示错误：找不到或无法加载主类的原因分析与解决方式
- swift开发
- 数据结构——第四讲、树（中）（1）
- nametuple用法（转）
- Leetcode:215. Kth Largest Element in an Array
- LeetCode-Find All Duplicates in an Array & Find All Numbers Disappeared in an Array
- Git 撤销提交
- Win10启用Administrator帐户
- gRPC服务发现&负载均衡
- GIT命令
- 线性结构上的动态规划
- 如何通过Mysql的二进制日志恢复数据库数据
- C++ 高精算法
