xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-15 00:26:05 +00: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
zh-hant/codes/go/chapter_dynamic_programming/min_path_sum_test.go
+4 -4
View File
@@ -20,7 +20,7 @@ func TestMinPathSum(t *testing.T) {
// 暴力搜尋
res := minPathSumDFS(grid, n-1, m-1)
fmt.Printf("從左上角到右下角的做小路徑和為 %d\n", res)
fmt.Printf("從左上角到右下角的最小路徑和為 %d\n", res)
// 記憶化搜尋
mem := make([][]int, n)
@@ -31,13 +31,13 @@ func TestMinPathSum(t *testing.T) {
}
}
res = minPathSumDFSMem(grid, mem, n-1, m-1)
fmt.Printf("從左上角到右下角的做小路徑和為 %d\n", res)
fmt.Printf("從左上角到右下角的最小路徑和為 %d\n", res)
// 動態規劃
res = minPathSumDP(grid)
fmt.Printf("從左上角到右下角的做小路徑和為 %d\n", res)
fmt.Printf("從左上角到右下角的最小路徑和為 %d\n", res)
// 空間最佳化後的動態規劃
res = minPathSumDPComp(grid)
fmt.Printf("從左上角到右下角的做小路徑和為 %d\n", res)
fmt.Printf("從左上角到右下角的最小路徑和為 %d\n", res)
}