algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-06 14:27:26 +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

4
codes/javascript/chapter_computational_complexity/time_complexity.js
View File

@ -77,7 +77,7 @@ function exponential(n) {
/* 指数阶（递归实现） */
function expRecur(n) {
if (n == 1) return 1;
if (n === 1) return 1;
return expRecur(n - 1) + expRecur(n - 1) + 1;
}
@ -109,7 +109,7 @@ function linearLogRecur(n) {
/* 阶乘阶（递归实现） */
function factorialRecur(n) {
if (n == 0) return 1;
if (n === 0) return 1;
let count = 0;
// 从 1 个分裂出 n 个
for (let i = 0; i < n; i++) {