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

Merge pull request #2225 from jjnnzb/master

Browse Source 
fix: 表述修改
This commit is contained in:
程序员Carl
2023-08-16 09:51:50 +08:00
committed by GitHub
parent c2c6374e47 d3eb234491
commit e916a0e26e
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

@ -28,7 +28,7 @@
![416.分割等和子集1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210117171307407.png) ![416.分割等和子集1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210117171307407.png)
至于背包九讲其其他背包，面试几乎不会问，都是竞赛级别的了，leetcode上连多重背包的题目都没有，所以题库也告诉我们，01背包和完全背包就够用了。 至于背包九讲其他背包，面试几乎不会问，都是竞赛级别的了，leetcode上连多重背包的题目都没有，所以题库也告诉我们，01背包和完全背包就够用了。
而完全背包又是也是01背包稍作变化而来，即：完全背包的物品数量是无限的。 而完全背包又是也是01背包稍作变化而来，即：完全背包的物品数量是无限的。