Update knapsack_problem and intro_to_dp

Fix avl_tree
2026-07-04 11:44:21 +00:00 · 2023-07-09 02:39:58 +08:00
parent cbfb9e59ad
commit cddddb8b8b
17 changed files with 61 additions and 48 deletions
@@ -9,7 +9,7 @@ def climbing_stairs_constraint_dp(n: int) -> int:
    """带约束爬楼梯：动态规划"""
    if n == 1 or n == 2:
        return n
-    # 初始化 dp 列表，用于存储子问题的解
+    # 初始化 dp 表，用于存储子问题的解
    dp = [[0] * 3 for _ in range(n + 1)]
    # 初始状态：预设最小子问题的解
    dp[1][1], dp[1][2] = 1, 0