github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions 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

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

@@ -163,7 +163,7 @@ dp[1] = dp[1 - weight[0]] + value[0] = 15
一维dp，分别用物品0，物品1，物品2 来遍历背包，最终得到结果如下：
![动态规划-背包问题9](https://code-thinking-1253855093.file.myqcloud.com/pics/20210110103614769.png)
![动态规划-背包问题9](https://file.kamacoder.com/pics/20210110103614769.png)
本题力扣上没有原题，大家可以去[卡码网第46题](https://kamacoder.com/problempage.php?pid=1046)去练习，题意是一样的，代码如下：