CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 03:30:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat(chapter_backtracking): Add js and ts codes for chapter 13.3 (#667)

Browse Source 
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1

* style(chapter_dynamic_programming): format code

* refactor(chapter_dynamic_programming): remove main definition and add type

* feat(chapter_backtracking): Add js and ts codes for chapter 13.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.2

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.4

* style(chapter_divide_and_conquer): fix typo

* refactor: Use === instead of == in js and ts
This commit is contained in:
William Yuan
2023-08-03 14:44:49 +08:00
committed by GitHub
parent c7c33f19ac
commit 70784a1ec3
31 changed files with 610 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/javascript/chapter_heap/my_heap.js
View File

@@ -103,7 +103,7 @@ class MaxHeap {
if (l < this.size() && this.#maxHeap[l] > this.#maxHeap[ma]) ma = l;
if (r < this.size() && this.#maxHeap[r] > this.#maxHeap[ma]) ma = r;
// 若节点 i 最大或索引 l, r 越界，则无需继续堆化，跳出
if (ma == i) break;
if (ma === i) break;
// 交换两节点
this.#swap(i, ma);
// 循环向下堆化