algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-01 20:12:07 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes and improvements (#1572)

Browse Source 
* Sync zh and zh-hant versions.

* Remove the polyfill.io link from mkdocs.yml

* Update contributors' info for code reviewers and en/zh-hant versions reviewers.

* Fix graph.md

* Update avatars for English version reviewers.

* Sync zh and zh-hant versions.

* Fix two_sum_brute_force.png

* Sync zh and zh-hant versions.
Optimize structrue of index.html.

* Format index.html
This commit is contained in:
Yudong Jin
2024-11-25 19:21:11 +08:00
committed by GitHub
parent 01a5f7b09f
commit 2a9db6d039
65 changed files with 414 additions and 140 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
zh-hant/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}")