github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
youngyangyang04
2021-08-06 15:34:33 +08:00
parent 5d7e0288a1
commit 029cf012ee
18 changed files with 674 additions and 575 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -92,7 +92,7 @@ dp状态图如下：
遍历背包容量在外层循环，遍历物品在内层循环，状态如图：
![动态规划-完全背包2](https://img-blog.csdnimg.cn/20210126104741304.jpg)
![动态规划-完全背包2](https://code-thinking-1253855093.file.myqcloud.com/pics/20210729234011.png)
看了这两个图，大家就会理解，完全背包中，两个for循环的先后循序，都不影响计算dp[j]所需要的值（这个值就是下标j之前所对应的dp[j]）。