algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-06 22:34:18 +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/python/chapter_dynamic_programming/min_path_sum.py
View File

@ -88,17 +88,17 @@ if __name__ == "__main__":
# 暴力搜索
res = min_path_sum_dfs(grid, n - 1, m - 1)
print(f"从左上角到右下角的做小路径和为 {res}")
print(f"从左上角到右下角的最小路径和为 {res}")
# 记忆化搜索
mem = [[-1] * m for _ in range(n)]
res = min_path_sum_dfs_mem(grid, mem, n - 1, m - 1)
print(f"从左上角到右下角的做小路径和为 {res}")
print(f"从左上角到右下角的最小路径和为 {res}")
# 动态规划
res = min_path_sum_dp(grid)
print(f"从左上角到右下角的做小路径和为 {res}")
print(f"从左上角到右下角的最小路径和为 {res}")
# 空间优化后的动态规划
res = min_path_sum_dp_comp(grid)
print(f"从左上角到右下角的做小路径和为 {res}")
print(f"从左上角到右下角的最小路径和为 {res}")