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

Update 0494.目标和.md

Browse Source
This commit is contained in:
weijiew
2021-05-20 19:55:25 +08:00
committed by GitHub
parent 942bd655b6
commit 398e2b754e
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -225,7 +225,7 @@ public:
是的，如果仅仅是求个数的话，就可以用dp，但[回溯算法：39. 组合总和](https://mp.weixin.qq.com/s/FLg8G6EjVcxBjwCbzpACPw)要求的是把所有组合列出来，还是要使用回溯法爆搜的。
本地还是有点难度，大家也可以记住，在求装满背包有几种方法的情况下，递推公式一般为：
本题还是有点难度，大家也可以记住，在求装满背包有几种方法的情况下，递推公式一般为：
```
dp[j] += dp[j - nums[i]];