algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 21:24:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat(csharp) .NET 8.0 code migration (#966)

Browse Source 
* .net 8.0 migration

* update docs

* revert change

* revert change and update appendix docs

* remove static

* Update binary_search_insertion.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
hpstory
2023-11-26 23:18:44 +08:00
committed by GitHub
parent d960c99a1f
commit 56b20eff36
93 changed files with 539 additions and 487 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -8,7 +8,7 @@ namespace hello_algo.chapter_dynamic_programming;
public class min_path_sum {
/* 最小路径和：暴力搜索 */
public int MinPathSumDFS(int[][] grid, int i, int j) {
int MinPathSumDFS(int[][] grid, int i, int j) {
// 若为左上角单元格，则终止搜索
if (i == 0 && j == 0) {
return grid[0][0];
@ -25,7 +25,7 @@ public class min_path_sum {
}
/* 最小路径和：记忆化搜索 */
public int MinPathSumDFSMem(int[][] grid, int[][] mem, int i, int j) {
int MinPathSumDFSMem(int[][] grid, int[][] mem, int i, int j) {
// 若为左上角单元格，则终止搜索
if (i == 0 && j == 0) {
return grid[0][0];
@ -47,7 +47,7 @@ public class min_path_sum {
}
/* 最小路径和：动态规划 */
public int MinPathSumDP(int[][] grid) {
int MinPathSumDP(int[][] grid) {
int n = grid.Length, m = grid[0].Length;
// 初始化 dp 表
int[,] dp = new int[n, m];
@ -70,7 +70,7 @@ public class min_path_sum {
}
/* 最小路径和：空间优化后的动态规划 */
public int MinPathSumDPComp(int[][] grid) {
int MinPathSumDPComp(int[][] grid) {
int n = grid.Length, m = grid[0].Length;
// 初始化 dp 表
int[] dp = new int[m];
@ -94,12 +94,12 @@ public class min_path_sum {
[Test]
public void Test() {
int[][] grid =
{
new int[4] { 1, 3, 1, 5 },
new int[4] { 2, 2, 4, 2 },
new int[4] { 5, 3, 2, 1 },
new int[4] { 4, 3, 5, 2 }
};
[
[1, 3, 1, 5],
[2, 2, 4, 2],
[5, 3, 2, 1],
[4, 3, 5, 2]
];
int n = grid.Length, m = grid[0].Length;