feat: add solutions to lc problem: No.0518.Coin Change 2

Author: maolonglong

solution/0500-0599/0518.Coin Change 2/README.md

@@ -33,7 +33,7 @@
 
 <p><strong>示例 3:</strong></p>
 
-<pre><strong>输入:</strong> amount = 10, coins = [10] 
+<pre><strong>输入:</strong> amount = 10, coins = [10]
 <strong>输出:</strong> 1
 </pre>
 
@@ -55,22 +55,57 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+完全背包问题
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def change(self, amount: int, coins: List[int]) -> int:
+        dp = [0 for i in range(amount + 1)]
+        dp[0] = 1
+        for coin in coins:
+            for j in range(coin, amount + 1):
+                dp[j] += dp[j - coin]
+        return dp[amount]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int change(int amount, int[] coins) {
+        int[] dp = new int[amount + 1];
+        dp[0] = 1;
+        for (int coin : coins) {
+            for (int j = coin; j <= amount; j++) {
+                dp[j] += dp[j - coin];
+            }
+        }
+        return dp[amount];
+    }
+}
+```
 
+### **Go**
+
+```go
+func change(amount int, coins []int) int {
+	dp := make([]int, amount+1)
+	dp[0] = 1
+	for _, coin := range coins {
+		for j := coin; j <= amount; j++ {
+			dp[j] += dp[j-coin]
+		}
+	}
+	return dp[amount]
+}
 ```
 
 ### **...**

solution/0500-0599/0518.Coin Change 2/README_EN.md

@@ -64,7 +64,7 @@
 
 <pre>
 
-<b>Input:</b> amount = 10, coins = [10] 
+<b>Input:</b> amount = 10, coins = [10]
 
 <b>Output:</b> 1
 
@@ -95,18 +95,53 @@
 
 ## Solutions
 
+Complete knapsack problem
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def change(self, amount: int, coins: List[int]) -> int:
+        dp = [0 for i in range(amount + 1)]
+        dp[0] = 1
+        for coin in coins:
+            for j in range(coin, amount + 1):
+                dp[j] += dp[j - coin]
+        return dp[amount]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int change(int amount, int[] coins) {
+        int[] dp = new int[amount + 1];
+        dp[0] = 1;
+        for (int coin : coins) {
+            for (int j = coin; j <= amount; j++) {
+                dp[j] += dp[j - coin];
+            }
+        }
+        return dp[amount];
+    }
+}
+```
 
+### **Go**
+
+```go
+func change(amount int, coins []int) int {
+	dp := make([]int, amount+1)
+	dp[0] = 1
+	for _, coin := range coins {
+		for j := coin; j <= amount; j++ {
+			dp[j] += dp[j-coin]
+		}
+	}
+	return dp[amount]
+}
 ```
 
 ### **...**

solution/0500-0599/0518.Coin Change 2/Solution.go

@@ -0,0 +1,10 @@
+func change(amount int, coins []int) int {
+	dp := make([]int, amount+1)
+	dp[0] = 1
+	for _, coin := range coins {
+		for j := coin; j <= amount; j++ {
+			dp[j] += dp[j-coin]
+		}
+	}
+	return dp[amount]
+}

solution/0500-0599/0518.Coin Change 2/Solution.java

@@ -1,12 +1,12 @@
 class Solution {
     public int change(int amount, int[] coins) {
-        int[] f = new int[amount + 1];
-        f[0] = 1;
+        int[] dp = new int[amount + 1];
+        dp[0] = 1;
         for (int coin : coins) {
-            for (int i = coin; i <= amount; ++i) {
-                f[i] += f[i - coin];
+            for (int j = coin; j <= amount; j++) {
+                dp[j] += dp[j - coin];
             }
         }
-        return f[amount];
+        return dp[amount];
     }
 }

solution/0500-0599/0518.Coin Change 2/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def change(self, amount: int, coins: List[int]) -> int:
+        dp = [0 for i in range(amount + 1)]
+        dp[0] = 1
+        for coin in coins:
+            for j in range(coin, amount + 1):
+                dp[j] += dp[j - coin]
+        return dp[amount]