xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-24 09:56:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

prepare 1.0.0b5 release

Browse source
This commit is contained in:
krahets 2023-09-10 23:11:50 +08:00
parent 3530f8c5ce
commit 2b54352bec
2 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
codes/javascript/chapter_heap/top_k.js
View file

@ -7,7 +7,7 @@
const { MaxHeap } = require('./my_heap');
/* 基于堆查找数组中最大的 k 个元素 */
function top_k_heap(nums, k) {
function topKHeap(nums, k) {
// 使用大顶堆 MaxHeap，对数组 nums 取相反数
const invertedNums = nums.map((num) => -num);
// 将数组的前 k 个元素入堆
@ -30,5 +30,5 @@ function top_k_heap(nums, k) {
/* Driver Code */
const nums = [1, 7, 6, 3, 2];
const k = 3;
const res = top_k_heap(nums, k);
const res = topKHeap(nums, k);
console.log(`最大的 ${k} 个元素为`, res);

4
codes/typescript/chapter_heap/top_k.ts
View file

@ -7,7 +7,7 @@
import { MaxHeap } from './my_heap';
/* 基于堆查找数组中最大的 k 个元素 */
function top_k_heap(nums: number[], k: number): number[] {
function topKHeap(nums: number[], k: number): number[] {
// 将堆中所有元素取反，从而用大顶堆来模拟小顶堆
const invertedNums = nums.map((num) => -num);
// 将数组的前 k 个元素入堆
@ -30,5 +30,5 @@ function top_k_heap(nums: number[], k: number): number[] {
/* Driver Code */
const nums = [1, 7, 6, 3, 2];
const k = 3;
const res = top_k_heap(nums, k);
const res = topKHeap(nums, k);
console.log(`最大的 ${k} 个元素为`, res);