build

2026-02-13 23:55:39 +08:00 · 2023-08-24 17:47:18 +08:00
parent 92a0853ab8
commit c6f0dfbdc8
10 changed files with 958 additions and 59 deletions
--- a/chapter_dynamic_programming/unbounded_knapsack_problem.md
+++ b/chapter_dynamic_programming/unbounded_knapsack_problem.md
@@ -1307,7 +1307,7 @@ $$
                    // 若超过背包容量，则不选硬币 i
                    dp[i][a] = dp[i-1][a]
                } else {
-                    // 不选和选硬币 i 这两种方案的较小值
+                    // 不选和选硬币 i 这两种方案之和
                    dp[i][a] = dp[i-1][a] + dp[i][a-coins[i-1]]
                }
            }