From 484d320502e0756c61396c3beb461fcedd65229a Mon Sep 17 00:00:00 2001
From: LiangDazhu <42199191+LiangDazhu@users.noreply.github.com>
Date: Tue, 8 Jun 2021 00:08:38 +0800
Subject: [PATCH] =?UTF-8?q?Update=200518.=E9=9B=B6=E9=92=B1=E5=85=91?=
 =?UTF-8?q?=E6=8D=A2II.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Added python version code
---
 problems/0518.零钱兑换II.md | 13 +++++++++++--
 1 file changed, 11 insertions(+), 2 deletions(-)

diff --git a/problems/0518.零钱兑换II.md b/problems/0518.零钱兑换II.md
index 2dee030c..7ee8818e 100644
--- a/problems/0518.零钱兑换II.md
+++ b/problems/0518.零钱兑换II.md
@@ -101,7 +101,7 @@ dp[j] （考虑coins[i]的组合总和） 就是所有的dp[j - coins[i]]（不
 
 而本题要求凑成总和的组合数，元素之间要求没有顺序。
 
-所以纯完全背包是能凑成总结就行，不用管怎么凑的。
+所以纯完全背包是能凑成总和就行，不用管怎么凑的。
 
 本题是求凑出来的方案个数，且每个方案个数是为组合数。
 
@@ -206,7 +206,16 @@ class Solution {
 ```
 
 Python：
-
+```python
+class Solution:
+    def change(self, amount: int, coins: List[int]) -> int:
+        dp = [0] * (amount + 1)
+        dp[0] = 1
+        for i in range(len(coins)):
+            for j in range(coins[i], amount + 1):
+                dp[j] += dp[j - coins[i]]
+        return dp[amount]
+```
 
 Go：