algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +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/swift/chapter_dynamic_programming/min_path_sum.swift
View File

@ -105,19 +105,19 @@ enum MinPathSum {
// 暴力搜尋
var res = minPathSumDFS(grid: grid, i: n - 1, j: m - 1)
print("從左上角到右下角的做小路徑和為 \(res)")
print("從左上角到右下角的最小路徑和為 \(res)")
// 記憶化搜尋
var mem = Array(repeating: Array(repeating: -1, count: m), count: n)
res = minPathSumDFSMem(grid: grid, mem: &mem, i: n - 1, j: m - 1)
print("從左上角到右下角的做小路徑和為 \(res)")
print("從左上角到右下角的最小路徑和為 \(res)")
// 動態規劃
res = minPathSumDP(grid: grid)
print("從左上角到右下角的做小路徑和為 \(res)")
print("從左上角到右下角的最小路徑和為 \(res)")
// 空間最佳化後的動態規劃
res = minPathSumDPComp(grid: grid)
print("從左上角到右下角的做小路徑和為 \(res)")
print("從左上角到右下角的最小路徑和為 \(res)")
}
}