CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-10-29 03:35:32 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1932 from Logenleedev/my-contribution

Browse Source 
删除typo
This commit is contained in:
程序员Carl
2023-03-14 15:40:48 +08:00
committed by GitHub
parent fb4b20e136 aea8bee954
commit 8b7252058d
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0494.目标和.md
View File

@@ -167,7 +167,7 @@ dp[j] 表示：填满j（包括j）这么大容积的包，有dp[j]种方法
有哪些来源可以推出dp[j]呢？
只要搞到nums[i]），凑成dp[j]就有dp[j - nums[i]] 种方法。
只要搞到nums[i]，凑成dp[j]就有dp[j - nums[i]] 种方法。
例如：dp[j]，j 为5，