algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
weiting-cn
2022-01-13 17:06:28 +08:00
parent 6b85bbd2eb
commit 6586f9a829
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/背包问题理论基础完全背包.md
View File

@ -52,7 +52,7 @@ for(int i = 0; i < weight.size(); i++) { // 遍历物品
```CPP ```CPP
// 先遍历物品，再遍历背包 // 先遍历物品，再遍历背包
for(int i = 0; i < weight.size(); i++) { // 遍历物品 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]); dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
} }