mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-13 23:56:07 +00:00
fix(csharp): Modify method name to PascalCase, simplify new expression (#840)
* Modify method name to PascalCase(array and linked list) * Modify method name to PascalCase(backtracking) * Modify method name to PascalCase(computational complexity) * Modify method name to PascalCase(divide and conquer) * Modify method name to PascalCase(dynamic programming) * Modify method name to PascalCase(graph) * Modify method name to PascalCase(greedy) * Modify method name to PascalCase(hashing) * Modify method name to PascalCase(heap) * Modify method name to PascalCase(searching) * Modify method name to PascalCase(sorting) * Modify method name to PascalCase(stack and queue) * Modify method name to PascalCase(tree) * local check
This commit is contained in:
@@ -8,7 +8,7 @@ namespace hello_algo.chapter_dynamic_programming;
|
||||
|
||||
public class climbing_stairs_constraint_dp {
|
||||
/* 带约束爬楼梯:动态规划 */
|
||||
public int climbingStairsConstraintDP(int n) {
|
||||
public int ClimbingStairsConstraintDP(int n) {
|
||||
if (n == 1 || n == 2) {
|
||||
return 1;
|
||||
}
|
||||
@@ -30,7 +30,7 @@ public class climbing_stairs_constraint_dp {
|
||||
[Test]
|
||||
public void Test() {
|
||||
int n = 9;
|
||||
int res = climbingStairsConstraintDP(n);
|
||||
int res = ClimbingStairsConstraintDP(n);
|
||||
Console.WriteLine($"爬 {n} 阶楼梯共有 {res} 种方案");
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user