CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新图床

Browse Source
This commit is contained in:
programmercarl
2023-03-10 14:02:32 +08:00
parent 2a9b627a90
commit 17cb4b45c7
134 changed files with 1169 additions and 829 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -68,7 +68,8 @@ for(int i = 0; i < weight.size(); i++) { // 遍历物品
dp状态图如下：
![动态规划-完全背包](https://img-blog.csdnimg.cn/20210126104510106.jpg)
![动态规划-完全背包](https://code-thinking-1253855093.file.myqcloud.com/pics/20210126104510106.jpg)
相信很多同学看网上的文章，关于完全背包介绍基本就到为止了。
@@ -91,7 +92,8 @@ dp状态图如下：
遍历物品在外层循环，遍历背包容量在内层循环，状态如图：
![动态规划-完全背包1](https://img-blog.csdnimg.cn/20210126104529605.jpg)
![动态规划-完全背包1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210126104529605.jpg)
遍历背包容量在外层循环，遍历物品在内层循环，状态如图：