diff --git a/codes/javascript/chapter_heap/top_k.js b/codes/javascript/chapter_heap/top_k.js
index 700337fd5..a74461296 100644
--- a/codes/javascript/chapter_heap/top_k.js
+++ b/codes/javascript/chapter_heap/top_k.js
@@ -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);
diff --git a/codes/typescript/chapter_heap/top_k.ts b/codes/typescript/chapter_heap/top_k.ts
index 287997a05..28fda1108 100644
--- a/codes/typescript/chapter_heap/top_k.ts
+++ b/codes/typescript/chapter_heap/top_k.ts
@@ -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);