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

Fix code naming style.

Browse Source
This commit is contained in:
krahets
2023-10-15 21:18:09 +08:00
parent ada37fd1f8
commit 346c8451de
23 changed files with 51 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/csharp/chapter_dynamic_programming/climbing_stairs_dfs.cs
View File

@@ -8,18 +8,18 @@ namespace hello_algo.chapter_dynamic_programming;
public class climbing_stairs_dfs {
/* 搜索 */
public int Dfs(int i) {
public int DFS(int i) {
// 已知 dp[1] 和 dp[2] ，返回之
if (i == 1 || i == 2)
return i;
// dp[i] = dp[i-1] + dp[i-2]
int count = Dfs(i - 1) + Dfs(i - 2);
int count = DFS(i - 1) + DFS(i - 2);
return count;
}
/* 爬楼梯：搜索 */
public int ClimbingStairsDFS(int n) {
return Dfs(n);
return DFS(n);
}
[Test]

6
codes/csharp/chapter_dynamic_programming/climbing_stairs_dfs_mem.cs
View File

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_dynamic_programming;
public class climbing_stairs_dfs_mem {
/* 记忆化搜索 */
public int Dfs(int i, int[] mem) {
public int DFS(int i, int[] mem) {
// 已知 dp[1] 和 dp[2] ，返回之
if (i == 1 || i == 2)
return i;
@@ -16,7 +16,7 @@ public class climbing_stairs_dfs_mem {
if (mem[i] != -1)
return mem[i];
// dp[i] = dp[i-1] + dp[i-2]
int count = Dfs(i - 1, mem) + Dfs(i - 2, mem);
int count = DFS(i - 1, mem) + DFS(i - 2, mem);
// 记录 dp[i]
mem[i] = count;
return count;
@@ -27,7 +27,7 @@ public class climbing_stairs_dfs_mem {
// mem[i] 记录爬到第 i 阶的方案总数，-1 代表无记录
int[] mem = new int[n + 1];
Array.Fill(mem, -1);
return Dfs(n, mem);
return DFS(n, mem);
}
[Test]