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

Merge pull request #345 from LiangDazhu/patch-28

Browse Source 
Update 0518.零钱兑换II.md
This commit is contained in:
程序员Carl
2021-06-08 15:16:25 +08:00
committed by GitHub
parent 7f352c8aff 16d9505c8d
commit 1edf9bb70f
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0518.零钱兑换II.md
View File

@ -101,7 +101,7 @@ dp[j] （考虑coins[i]的组合总和） 就是所有的dp[j - coins[i]]（不
而本题要求凑成总和的组合数，元素之间要求没有顺序。
所以纯完全背包是能凑成总结就行，不用管怎么凑的。
所以纯完全背包是能凑成总和就行，不用管怎么凑的。
本题是求凑出来的方案个数，且每个方案个数是为组合数。
@ -207,6 +207,7 @@ class Solution {
Python：
```python3
class Solution:
def change(self, amount: int, coins: List[int]) -> int:
@ -222,7 +223,6 @@ class Solution:
Go：