leetcode215. Kth Largest Element in an Array
来源:互联网 发布:js获取访问者ip地址 编辑:程序博客网 时间:2024/05/16 11:34
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.
解法
维护长度为k的优先队列
public class Solution { public int findKthLargest(int[] nums, int k) { if (nums == null || nums.length == 0 || k > nums.length) { return -1; } PriorityQueue<Integer> pq = new PriorityQueue<>(); for (int num : nums) { pq.offer(num); if (pq.size() > k) { pq.poll(); } } return pq.peek(); }}
阅读全文
0 0
- LeetCode215:Kth Largest Element in an Array
- LeetCode215. Kth Largest Element in an Array
- Leetcode215: Kth Largest Element in an Array
- Leetcode215. Kth Largest Element in an Array
- leetcode215. Kth Largest Element in an Array
- LeetCode215. Kth Largest Element in an Array分治法
- LeetCode215. Kth Largest Element in an Array(Medium)
- leetcode215---Kth Largest Element in an Array(第k大元素)
- Kth Largest Element in an Array
- Leetcode Kth Largest Element in an Array
- Kth Largest Element in an Array
- 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] Kth Largest Element in an Array
- Kth Largest Element in an Array
- 《Python网络编程基础》笔记(一)----底层网络
- IP地址的分类
- IO流
- 共享内存
- 软件工程(C编码实践篇)学习总结
- leetcode215. Kth Largest Element in an Array
- ESL中的记号
- 点击返回键:弹出退出的对话框和双击两次返回键,退出
- 欢迎使用CSDN-markdown编辑器
- POJ 2102 Incredible! Impossible! 笔记
- 商城项目实战01:使用maven构建工程
- HTTP 协议中的 Transfer-Encoding
- 计算机图形学基础(1)——画线算法
- Intellij idea远程debug连接tomcat,实现单步调试