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

Merge pull request #15 from weijiew/patch-3

Browse Source 
Update 背包理论基础01背包-1.md 纠正表达
This commit is contained in:
Carl Sun
2021-05-12 14:00:34 +08:00
committed by GitHub
parent 4cbdfc079e ee9afc13e8
commit f487357fe0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/背包理论基础01背包-1.md
View File

@ -91,7 +91,7 @@ leetcode上没有纯01背包的问题，都是01背包应用方面的题目，
**关于初始化，一定要和dp数组的定义吻合，否则到递推公式的时候就会越来越乱**。
首先从dp[i][j]的定义触发，如果背包容量j为0的话，即dp[i][0]，无论是选取哪些物品，背包价值总和一定为0。如图：
首先从dp[i][j]的定义出发，如果背包容量j为0的话，即dp[i][0]，无论是选取哪些物品，背包价值总和一定为0。如图：
![动态规划-背包问题2](https://img-blog.csdnimg.cn/2021011010304192.png)