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

fix some typos (#1540)

Browse Source
This commit is contained in:
Flamingo
2024-10-31 21:26:28 +08:00
committed by GitHub
parent b3b10f2300
commit 57cf6b1ea6
6 changed files with 24 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/dart/chapter_dynamic_programming/min_path_sum.dart
View File

@ -103,18 +103,18 @@ void main() {
// 暴力搜索
int res = minPathSumDFS(grid, n - 1, m - 1);
print("从左上角到右下角的做小路径和为 $res");
print("从左上角到右下角的最小路径和为 $res");
// 记忆化搜索
List<List<int>> mem = List.generate(n, (i) => List.filled(m, -1));
res = minPathSumDFSMem(grid, mem, n - 1, m - 1);
print("从左上角到右下角的做小路径和为 $res");
print("从左上角到右下角的最小路径和为 $res");
// 动态规划
res = minPathSumDP(grid);
print("从左上角到右下角的做小路径和为 $res");
print("从左上角到右下角的最小路径和为 $res");
// 空间优化后的动态规划
res = minPathSumDPComp(grid);
print("从左上角到右下角的做小路径和为 $res");
print("从左上角到右下角的最小路径和为 $res");
}