Update 03.Knapsack-Problem-03.md

itcharge · May 14, 2024 · e11bc80 · e11bc80
1 parent 49ec60b
commit e11bc80
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md b/Contents/10.Dynamic-Programming/04.Knapsack-Problem/03.Knapsack-Problem-03.md
@@ -2,7 +2,7 @@
 
 > **多重背包问题**：有 $n$ 种物品和一个最多能装重量为 $W$ 的背包，第 $i$ 种物品的重量为 $weight[i]$，价值为 $value[i]$，件数为 $count[i]$。请问在总重量不超过背包载重上限的情况下，能装入背包的最大价值是多少？
 
-![](https://qcdn.itcharge.cn/images/202303191809178.png)
+![多重背包问题](https://qcdn.itcharge.cn/images/20240514111701.png)
 
 ### 4.1 多重背包问题基本思路