修复完全背包遍历背包容量时的边界问题

weiting-cn · weiting-cn · commit 6586f9a82991 · 2022-01-13T17:06:28.000+08:00
diff --git a/problems/背包问题理论基础完全背包.md b/problems/背包问题理论基础完全背包.md
@@ -52,7 +52,7 @@ for(int i = 0; i < weight.size(); i++) { // 遍历物品
 ```CPP
 // 先遍历物品，再遍历背包
 for(int i = 0; i < weight.size(); i++) { // 遍历物品
-    for(int j = weight[i]; j < bagWeight ; j++) { // 遍历背包容量
+    for(int j = weight[i]; j <= bagWeight ; j++) { // 遍历背包容量
         dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
 
     }

Original file line number	Diff line number	Diff line change
`@@ -52,7 +52,7 @@ for(int i = 0; i < weight.size(); i++) { // 遍历物品`
`52`	`52`	```CPP
`53`	`53`	`// 先遍历物品，再遍历背包`
`54`	`54`	`for(int i = 0; i < weight.size(); i++) { // 遍历物品`
`55`		`- for(int j = weight[i]; j < bagWeight ; j++) { // 遍历背包容量`
	`55`	`+ for(int j = weight[i]; j <= bagWeight ; j++) { // 遍历背包容量`
`56`	`56`	`dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);`
`57`	`57`
`58`	`58`	`}`