215. Kth Largest Element in an Array
Given an integer array nums and an integer k, return the kth largest element in the array.
Note that it is the kth largest element in the sorted order, not the kth distinct element.
You must solve it in O(n) time complexity.
Example 1:
Input:nums = [3,2,1,5,6,4], k = 2
Output:5
Example 2:
Input:nums = [3,2,3,1,2,4,5,5,6], k = 4
Output:4
Note: The time complexity of built in merge sort is O(n log n) 所以这道题我们不能使用sort()，快速和归并都是nlogn，其他都是n^2。
var findKthLargest = function(nums, k) {
// nums = nums.sort((a, b) => (b - a))
// return nums[k - 1]
let heap = new MinPriorityQueue();
// let pq = new MinPriorityQueue();
for (let x of nums) {
heap.enqueue(x);
if (heap.size() > k) {
heap.dequeue();
}
}
// console.log(heap.back().element)
return heap.front().element;
};
