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

Add Java and C++ code for the chapter of DP.

Browse Source
This commit is contained in:
krahets
2023-07-11 01:08:26 +08:00
parent 465dafe9ec
commit ad0fd45cfb
9 changed files with 494 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
codes/csharp/chapter_dynamic_programming/min_path_sum.cs
View File

@@ -104,7 +104,8 @@ public class min_path_sum {
int n = grid.Length, m = grid[0].Length;
// 暴力搜索
Console.WriteLine(minPathSumDFS(grid, n - 1, m - 1));
int res = minPathSumDFS(grid, n - 1, m - 1);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
// 记忆化搜索
int[][] mem = new int[n][];
@@ -112,13 +113,15 @@ public class min_path_sum {
mem[i] = new int[m];
Array.Fill(mem[i], -1);
}
Console.WriteLine(minPathSumDFSMem(grid, mem, n - 1, m - 1));
res = minPathSumDFSMem(grid, mem, n - 1, m - 1);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
// 动态规划
Console.WriteLine(minPathSumDP(grid));
res = minPathSumDP(grid);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
// 状态压缩后的动态规划
Console.WriteLine(minPathSumDPComp(grid));
res = minPathSumDPComp(grid);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
}
}