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

Update 0494.目标和.md

Browse Source
This commit is contained in:
程序员Carl
2022-08-01 10:50:27 +08:00
committed by GitHub
parent c6db903790
commit 9343ddd30c
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

@ -158,7 +158,7 @@ dp[j] 表示：填满j（包括j）这么大容积的包，有dp[j]种方法
不考虑nums[i]的情况下，填满容量为j的背包，有dp[j]种方法。
那么只要搞到nums[i]的话，凑成dp[j]就有dp[j - nums[i]] 种方法。
那么考虑nums[i]的话（只要搞到nums[i]），凑成dp[j]就有dp[j - nums[i]] 种方法。
例如：dp[j]，j 为5，