CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-24 02:21:30 +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

8
codes/csharp/chapter_dynamic_programming/climbing_stairs_backtrack.cs
View File

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_dynamic_programming;
public class climbing_stairs_backtrack {
/* 回溯 */
public void Backtrack(List<int> choices, int state, int n, List<int> res) {
void Backtrack(List<int> choices, int state, int n, List<int> res) {
// 当爬到第 n 阶时，方案数量加 1
if (state == n)
res[0]++;
@@ -24,10 +24,10 @@ public class climbing_stairs_backtrack {
}
/* 爬楼梯：回溯 */
public int ClimbingStairsBacktrack(int n) {
List<int> choices = new() { 1, 2 }; // 可选择向上爬 1 或 2 阶
int ClimbingStairsBacktrack(int n) {
List<int> choices = [1, 2]; // 可选择向上爬 1 或 2 阶
int state = 0; // 从第 0 阶开始爬
List<int> res = new() { 0 }; // 使用 res[0] 记录方案数量
List<int> res = [0]; // 使用 res[0] 记录方案数量
Backtrack(choices, state, n, res);
return res[0];
}