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
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/周总结/20210121动规周末总结.md
View File

@@ -17,7 +17,7 @@
关于其他几种常用的背包，大家看这张图就了然于胸了：
![416.分割等和子集1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210117171307407-20230310133624872.png)
![416.分割等和子集1](https://file.kamacoder.com/pics/20210117171307407-20230310133624872.png)
本文用动规五部曲详细讲解了01背包的二维dp数组的实现方法，大家其实可以发现最简单的是推导公式了，推导公式估计看一遍就记下来了，但难就难在确定初始化和遍历顺序上。
@@ -70,7 +70,7 @@ for(int i = 1; i < weight.size(); i++) { // 遍历物品
来看一下对应的dp数组的数值，如图：
![动态规划-背包问题4](https://code-thinking-1253855093.file.myqcloud.com/pics/20210118163425129-20230310133630224.jpg)
![动态规划-背包问题4](https://file.kamacoder.com/pics/20210118163425129-20230310133630224.jpg)
最终结果就是dp[2][4]。
@@ -122,7 +122,7 @@ for(int i = 0; i < weight.size(); i++) { // 遍历物品
一维dp，分别用物品0，物品1，物品2 来遍历背包，最终得到结果如下：
![动态规划-背包问题9](https://code-thinking-1253855093.file.myqcloud.com/pics/20210110103614769-20230310133634873.png)
![动态规划-背包问题9](https://file.kamacoder.com/pics/20210110103614769-20230310133634873.png)
## 周三