algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix the code in min_path_sum

Browse Source
This commit is contained in:
krahets
2023-10-14 03:25:11 +08:00
parent 3df5c36370
commit a8c624fa5a
12 changed files with 48 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -15,8 +15,8 @@ function minPathSumDFS(grid, i, j) {
return Infinity;
}
// 计算从左上角到 (i-1, j) 和 (i, j-1) 的最小路径代价
const left = minPathSumDFS(grid, i - 1, j);
const up = minPathSumDFS(grid, i, j - 1);
const up = minPathSumDFS(grid, i - 1, j);
const left = minPathSumDFS(grid, i, j - 1);
// 返回从左上角到 (i, j) 的最小路径代价
return Math.min(left, up) + grid[i][j];
}
@@ -36,8 +36,8 @@ function minPathSumDFSMem(grid, mem, i, j) {
return mem[i][j];
}
// 左边和上边单元格的最小路径代价
const left = minPathSumDFSMem(grid, mem, i - 1, j);
const up = minPathSumDFSMem(grid, mem, i, j - 1);
const up = minPathSumDFSMem(grid, mem, i - 1, j);
const left = minPathSumDFSMem(grid, mem, i, j - 1);
// 记录并返回左上角到 (i, j) 的最小路径代价
mem[i][j] = Math.min(left, up) + grid[i][j];
return mem[i][j];