215. Kth Largest Element in an Array
来源:互联网 发布:多益网络实力 编辑:程序博客网 时间:2024/06/03 21:20
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(int[] nums, int k) { Arrays.sort(nums); return nums[nums.length - k]; }}
阅读全文
0 0
- 215.Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 215. Kth Largest Element in an Array
- 第五章(队列)
- MVC
- 高精度加法与高精度乘法
- Android最佳实践之UI篇
- Erl 命令笔记
- 215. Kth Largest Element in an Array
- 面向对象思考之类和对象的深入思考与理解,那些我们忽略的编程思想
- 输入输出挂模板
- The Unique MST POJ
- python自动化工具之pywinauto(二)
- JavaScript类型转换
- (M)Dynamic Programming:368. Largest Divisible Subset
- 插入排序
- IPC进程通信机制---------AIDL实战