[leetcode] 215. Kth Largest Element in an Array
2015-12-07 10:29
423 查看
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大的数,题目难度为Medium。
很容易想到用堆来解决带优先级的问题,这里使用priority_queue,具体代码:
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大的数,题目难度为Medium。
很容易想到用堆来解决带优先级的问题,这里使用priority_queue,具体代码:
class Solution { public: int findKthLargest(vector<int>& nums, int k) { priority_queue<int> heap; int ret; for(int i=0; i<nums.size(); i++) heap.push(nums[i]); for(int i=0; i<k; i++) { ret = heap.top(); heap.pop(); } return ret; } };
相关文章推荐
- 基于java中stack与heap的区别,java中的垃圾回收机制的相关介绍
- Grow heap (frag case) 堆内存过大的深入解析
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- 深入Java虚拟机
- Converting HEAP to MyISAM in SHOW PROCESSLIST
- 内部代码kghasp1发现某一Heap大小为0
- JDK5.0中JVM堆模型、GC垃圾收集详细解析
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList