leetcode_middle_57_215. Kth Largest Element in an Array
来源:互联网 发布:软件界面上面不见了 编辑:程序博客网 时间:2024/06/06 02:27
题意:
给一个无序数组,返回第k大的数。
分析:
很明显直接考虑优先队列就可以
public class Solution { public int findKthLargest(int[] nums, int k) { PriorityQueue<Integer> pq = new PriorityQueue<>(); for(int i : nums) { pq.offer(i); if(pq.size() > k) { pq.poll(); } } return pq.peek(); }}
0 0
- leetcode_middle_57_215. 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
- 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
- Kth Largest Element in an Array
- leetcode--Kth Largest Element in an Array
- Kth Largest Element in an Array
- 215.Kth Largest Element in an Array
- #leetcode#Kth Largest Element in an Array
- LeetCode Kth Largest Element in an Array
- LeetCode215:Kth Largest Element in an Array
- android弹出窗口-----dialog半透明、透明的圆角activity
- 语言模型(N-Gram)
- Android温习 —— 内存
- numpy使用
- 事件总线程之EventBus
- leetcode_middle_57_215. Kth Largest Element in an Array
- markdown使用手册记录
- idea在maven中导入jstl无效解决办法
- 两个有序序列的中位数
- **【HPUOJ】
- tomcat 不能识别maven web项目
- LeetCode OJ:Median of Two Sorted Arrays(两个有序数组的中位数)
- MQ消息中间件技术
- 使用Matlab对二值图像进行轮廓提取