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

删除typo

Browse Source
This commit is contained in:
Logen
2023-03-06 19:50:04 -06:00
parent e7bc3d3a7e
commit aea8bee954
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

@ -162,7 +162,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，