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

Fix a definition.

Browse Source
This commit is contained in:
krahets
2023-08-27 00:50:18 +08:00
parent debf42b189
commit 9731a46d67
85 changed files with 167 additions and 159 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/cpp/chapter_dynamic_programming/min_path_sum.cpp
View File

@@ -68,7 +68,7 @@ int minPathSumDP(vector<vector<int>> &grid) {
return dp[n - 1][m - 1];
}
/* 最小路径和：状态压缩后的动态规划 */
/* 最小路径和：空间优化后的动态规划 */
int minPathSumDPComp(vector<vector<int>> &grid) {
int n = grid.size(), m = grid[0].size();
// 初始化 dp 表
@@ -108,7 +108,7 @@ int main() {
res = minPathSumDP(grid);
cout << "从左上角到右下角的最小路径和为 " << res << endl;
// 状态压缩后的动态规划
// 空间优化后的动态规划
res = minPathSumDPComp(grid);
cout << "从左上角到右下角的最小路径和为 " << res << endl;