learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1243 from szluyu99/patch-1 

Update 背包问题理论基础完全背包.md
This commit is contained in:
程序员Carl 2022-05-10 07:39:40 +08:00 committed by GitHub
parent e2c9a4154a b5f11af3ed
commit 793129bf4c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -37,7 +37,7 @@
* [动态规划：关于01背包问题，你该了解这些！（滚动数组）](https://programmercarl.com/背包理论基础01背包-2.html) * [动态规划：关于01背包问题，你该了解这些！（滚动数组）](https://programmercarl.com/背包理论基础01背包-2.html)
首先在回顾一下01背包的核心代码 首先在回顾一下01背包的核心代码
``` ```cpp
for(int i = 0; i < weight.size(); i++) { // 遍历物品 for(int i = 0; i < weight.size(); i++) { // 遍历物品
for(int j = bagWeight; j >= weight[i]; j--) { // 遍历背包容量 for(int j = bagWeight; j >= weight[i]; j--) { // 遍历背包容量
dp[j] = max(dp[j], dp[j - weight[i]] + value[i]); dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);