mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 11:36:29 +08:00
34 lines
1.1 KiB
JavaScript
34 lines
1.1 KiB
JavaScript
/**
|
||
* File: top_k.js
|
||
* Created Time: 2023-08-13
|
||
* Author: Justin (xiefahit@gmail.com)
|
||
*/
|
||
|
||
const { MaxHeap } = require('./my_heap');
|
||
|
||
/* 基于堆查找数组中最大的 k 个元素 */
|
||
function topKHeap(nums, k) {
|
||
// 使用大顶堆 MaxHeap，对数组 nums 取相反数
|
||
const invertedNums = nums.map((num) => -num);
|
||
// 将数组的前 k 个元素入堆
|
||
const heap = new MaxHeap(invertedNums.slice(0, k));
|
||
// 从第 k+1 个元素开始，保持堆的长度为 k
|
||
for (let i = k; i < invertedNums.length; i++) {
|
||
// 若当前元素小于堆顶元素，则将堆顶元素出堆、当前元素入堆
|
||
if (invertedNums[i] < heap.peek()) {
|
||
heap.pop();
|
||
heap.push(invertedNums[i]);
|
||
}
|
||
}
|
||
// 取出堆中元素
|
||
const maxHeap = heap.getMaxHeap();
|
||
// 对堆中元素取相反数
|
||
const invertedMaxHeap = maxHeap.map((num) => -num);
|
||
return invertedMaxHeap;
|
||
}
|
||
|
||
/* Driver Code */
|
||
const nums = [1, 7, 6, 3, 2];
|
||
const k = 3;
|
||
const res = topKHeap(nums, k);
|
||
console.log(`最大的 ${k} 个元素为`, res);
|