CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-24 18:43:59 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes and improvements (#1813)

Browse Source 
* Sync zh and zh-hant version.

* Add the Warp sponsor banner.

* Update README with acknowledgments and Warp recommendation

Added acknowledgments and a recommendation for the Warp terminal application.

* Update README.md

* Update links in README.md to use HTTPS

* Sync zh and zh-hant versions.

* Add special thanks for Warp spnsorship.

* Use official warp image link.
This commit is contained in:
Yudong Jin
2025-09-23 20:44:38 +08:00
committed by GitHub
parent 790a6d17e1
commit 44effb07e6
37 changed files with 1009 additions and 636 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
zh-hant/docs/chapter_dynamic_programming/dp_solution_pipeline.md
View File

@@ -110,7 +110,7 @@ $$
![暴力搜尋遞迴樹](dp_solution_pipeline.assets/min_path_sum_dfs.png)
每個狀態都有向下和向右兩種選擇，從左上角走到右下角總共需要 $m + n - 2$ 步，所以最差時間複雜度為 $O(2^{m + n})$ ，其中 $n$ 和 $m$ 分別為網格的行數和列數。請注意，這種計算方式未考慮臨近網格邊界的情況，當到達網路邊界時只剩下一種選擇，因此實際的路徑數量會少一些。
每個狀態都有向下和向右兩種選擇，從左上角走到右下角總共需要 $m + n - 2$ 步，所以最差時間複雜度為 $O(2^{m + n})$ ，其中 $n$ 和 $m$ 分別為網格的行數和列數。請注意，這種計算方式未考慮臨近網格邊界的情況，當到達網格邊界時只剩下一種選擇，因此實際的路徑數量會少一些。
### 方法二：記憶化搜尋