algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +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_dynamic_programming/climbing_stairs_dfs.js
View File

@ -7,7 +7,7 @@
/* 搜索 */
function dfs(i) {
// 已知 dp[1] 和 dp[2] ，返回之
if (i == 1 || i == 2) return i;
if (i === 1 || i === 2) return i;
// dp[i] = dp[i-1] + dp[i-2]
const count = dfs(i - 1) + dfs(i - 2);
return count;

2
codes/javascript/chapter_dynamic_programming/climbing_stairs_dfs_mem.js
View File

@ -7,7 +7,7 @@
/* 记忆化搜索 */
function dfs(i, mem) {
// 已知 dp[1] 和 dp[2] ，返回之
if (i == 1 || i == 2) return i;
if (i === 1 || i === 2) return i;
// 若存在记录 dp[i] ，则直接返回之
if (mem[i] != -1) return mem[i];
// dp[i] = dp[i-1] + dp[i-2]

4
codes/javascript/chapter_dynamic_programming/climbing_stairs_dp.js
View File

@ -6,7 +6,7 @@
/* 爬楼梯：动态规划 */
function climbingStairsDP(n) {
if (n == 1 || n == 2) return n;
if (n === 1 || n === 2) return n;
// 初始化 dp 表，用于存储子问题的解
const dp = new Array(n + 1).fill(-1);
// 初始状态：预设最小子问题的解
@ -21,7 +21,7 @@ function climbingStairsDP(n) {
/* 爬楼梯：状态压缩后的动态规划 */
function climbingStairsDPComp(n) {
if (n == 1 || n == 2) return n;
if (n === 1 || n === 2) return n;
let a = 1,
b = 2;
for (let i = 3; i <= n; i++) {