CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 11:41:22 +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/go/chapter_dynamic_programming/min_path_sum_test.go
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)
}