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

Merge pull request #2607 from MrYoungg/master

Browse Source 
更新--背包理论基础01背包-1.md--补充代码块的CPP标识
This commit is contained in:
程序员Carl
2024-08-11 09:49:00 +08:00
committed by GitHub
parent 5aee1a9173 7dcbcb354c
commit 3e487ea890
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

@ -193,7 +193,7 @@ dp[0][j]，即：i为0，存放编号0的物品的时候，各个容量的背包
代码初始化如下： 代码初始化如下：
``` ```CPP
for (int j = 0 ; j < weight[0]; j++) { // 当然这一步，如果把dp数组预先初始化为0了，这一步就可以省略，但很多同学应该没有想清楚这一点。 for (int j = 0 ; j < weight[0]; j++) { // 当然这一步，如果把dp数组预先初始化为0了，这一步就可以省略，但很多同学应该没有想清楚这一点。
dp[0][j] = 0; dp[0][j] = 0;
} }