algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 04:31:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format JS and TS code.

Browse Source
This commit is contained in:
krahets
2023-09-02 23:07:47 +08:00
parent f96f583771
commit 978857570f
35 changed files with 75 additions and 74 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
codes/javascript/chapter_dynamic_programming/climbing_stairs_backtrack.js
View File

@ -32,4 +32,3 @@ function climbingStairsBacktrack(n) {
const n = 9;
const res = climbingStairsBacktrack(n);
console.log(`爬 ${n} 阶楼梯共有 ${res} 种方案`);

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

@ -38,4 +38,3 @@ let res = climbingStairsDP(n);
console.log(`爬 ${n} 阶楼梯共有 ${res} 种方案`);
res = climbingStairsDPComp(n);
console.log(`爬 ${n} 阶楼梯共有 ${res} 种方案`);

3
codes/javascript/chapter_dynamic_programming/knapsack.js
View File

@ -37,7 +37,8 @@ function knapsackDFSMem(wgt, val, mem, i, c) {
}
// 计算不放入和放入物品 i 的最大价值
const no = knapsackDFSMem(wgt, val, mem, i - 1, c);
const yes = knapsackDFSMem(wgt, val, mem, i - 1, c - wgt[i - 1]) + val[i - 1];
const yes =
knapsackDFSMem(wgt, val, mem, i - 1, c - wgt[i - 1]) + val[i - 1];
// 记录并返回两种方案中价值更大的那一个
mem[i][c] = Math.max(no, yes);
return mem[i][c];

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

@ -98,7 +98,7 @@ const grid = [
[2, 2, 4, 2],
[5, 3, 2, 1],
[4, 3, 5, 2],
]
];
const n = grid.length,
m = grid[0].length;
// 暴力搜索
@ -118,4 +118,4 @@ console.log(`从左上角到右下角的最小路径和为 ${res}`);
// 状态压缩后的动态规划
res = minPathSumDPComp(grid);
console.log(`从左上角到右下角的最小路径和为 ${res}`);
console.log(`从左上角到右下角的最小路径和为 ${res}`);