mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-02 04:31:55 +08: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 coin_change {
|
||||
/* 零钱兑换:动态规划 */
|
||||
public int coinChangeDP(int[] coins, int amt) {
|
||||
public int CoinChangeDP(int[] coins, int amt) {
|
||||
int n = coins.Length;
|
||||
int MAX = amt + 1;
|
||||
// 初始化 dp 表
|
||||
@ -33,7 +33,7 @@ public class coin_change {
|
||||
}
|
||||
|
||||
/* 零钱兑换:空间优化后的动态规划 */
|
||||
public int coinChangeDPComp(int[] coins, int amt) {
|
||||
public int CoinChangeDPComp(int[] coins, int amt) {
|
||||
int n = coins.Length;
|
||||
int MAX = amt + 1;
|
||||
// 初始化 dp 表
|
||||
@ -61,11 +61,11 @@ public class coin_change {
|
||||
int amt = 4;
|
||||
|
||||
// 动态规划
|
||||
int res = coinChangeDP(coins, amt);
|
||||
int res = CoinChangeDP(coins, amt);
|
||||
Console.WriteLine("凑到目标金额所需的最少硬币数量为 " + res);
|
||||
|
||||
// 空间优化后的动态规划
|
||||
res = coinChangeDPComp(coins, amt);
|
||||
res = CoinChangeDPComp(coins, amt);
|
||||
Console.WriteLine("凑到目标金额所需的最少硬币数量为 " + res);
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user