algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update knapsack_problem and intro_to_dp

Browse Source 
Fix avl_tree
This commit is contained in:
krahets
2023-07-09 02:39:58 +08:00
parent cbfb9e59ad
commit cddddb8b8b
17 changed files with 61 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/csharp/chapter_dynamic_programming/climbing_stairs_constraint_dp.cs
View File

@@ -12,7 +12,7 @@ public class climbing_stairs_constraint_dp {
if (n == 1 || n == 2) {
return n;
}
// 初始化 dp 列表，用于存储子问题的解
// 初始化 dp 表，用于存储子问题的解
int[,] dp = new int[n + 1, 3];
// 初始状态：预设最小子问题的解
dp[1, 1] = 1;

2
codes/csharp/chapter_dynamic_programming/climbing_stairs_dp.cs
View File

@@ -11,7 +11,7 @@ public class climbing_stairs_dp {
public int climbingStairsDP(int n) {
if (n == 1 || n == 2)
return n;
// 初始化 dp 列表，用于存储子问题的解
// 初始化 dp 表，用于存储子问题的解
int[] dp = new int[n + 1];
// 初始状态：预设最小子问题的解
dp[1] = 1;

4
codes/csharp/chapter_dynamic_programming/knapsack.cs
View File

@@ -49,7 +49,7 @@ public class knapsack {
/* 0-1 背包：动态规划 */
public int knapsack_dp(int[] weight, int[] val, int cap) {
int n = weight.Length;
// 初始化 dp 列表
// 初始化 dp 表
int[,] dp = new int[n + 1, cap + 1];
// 状态转移
for (int i = 1; i <= n; i++) {
@@ -69,7 +69,7 @@ public class knapsack {
/* 0-1 背包：状态压缩后的动态规划 */
public int knapsack_dp_comp(int[] weight, int[] val, int cap) {
int n = weight.Length;
// 初始化 dp 列表
// 初始化 dp 表
int[] dp = new int[cap + 1];
// 状态转移
for (int i = 1; i <= n; i++) {

2
codes/csharp/chapter_dynamic_programming/min_cost_climbing_stairs_dp.cs
View File

@@ -12,7 +12,7 @@ public class min_cost_climbing_stairs_dp {
int n = cost.Length - 1;
if (n == 1 || n == 2)
return cost[n];
// 初始化 dp 列表，用于存储子问题的解
// 初始化 dp 表，用于存储子问题的解
int[] dp = new int[n + 1];
// 初始状态：预设最小子问题的解
dp[1] = cost[1];