feat: add golang solution to lc problem: No.0322. Coin Change

Author: yanglbme

README.md

@@ -198,6 +198,7 @@
 - [摆动序列](./solution/0300-0399/0376.Wiggle%20Subsequence/README.md)
 - [最长公共子序列](./solution/1100-1199/1143.Longest%20Common%20Subsequence/README.md)
 - [编辑距离](./solution/0000-0099/0072.Edit%20Distance/README.md)
+- [零钱兑换](./solution/0300-0399/0322.Coin%20Change/README.md)
 - [礼物的最大价值](./lcof/面试题47.%20礼物的最大价值/README.md)
 - [俄罗斯套娃信封问题](./solution/0300-0399/0354.Russian%20Doll%20Envelopes/README.md)
 

README_EN.md

@@ -192,6 +192,7 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h
 - [Wiggle Subsequence](./solution/0300-0399/0376.Wiggle%20Subsequence/README_EN.md)
 - [Longest Common Subsequence](./solution/1100-1199/1143.Longest%20Common%20Subsequence/README_EN.md)
 - [Edit Distance](./solution/0000-0099/0072.Edit%20Distance/README_EN.md)
+- [Coin Change](./solution/0300-0399/0322.Coin%20Change/README_EN.md)
 - [Russian Doll Envelopes](./solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md)
 
 ### Backtracking

solution/0300-0399/0322.Coin Change/README.md

@@ -61,6 +61,8 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+动态规划。
+
 类似完全背包的思路，硬币数量不限，求凑成总金额所需的最少的硬币个数。
 
 <!-- tabs:start -->
@@ -138,4 +140,31 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func coinChange(coins []int, amount int) int {
+	dp := make([]int, amount+1)
+	for i := 1; i <= amount; i++ {
+		dp[i] = amount + 1
+	}
+	for _, coin := range coins {
+		for j := coin; j <= amount; j++ {
+			dp[j] = min(dp[j], dp[j-coin]+1)
+		}
+	}
+	if dp[amount] > amount {
+		return -1
+	}
+	return dp[amount]
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+```
+
 <!-- tabs:end -->

solution/0300-0399/0322.Coin Change/README_EN.md

@@ -59,6 +59,8 @@
 
 ## Solutions
 
+Dynamic programming.
+
 Similar to the idea of ​​a complete backpack, there is no limit to the number of coins. Find the minimum number of coins required to make up the total amount.
 
 <!-- tabs:start -->
@@ -132,4 +134,31 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func coinChange(coins []int, amount int) int {
+	dp := make([]int, amount+1)
+	for i := 1; i <= amount; i++ {
+		dp[i] = amount + 1
+	}
+	for _, coin := range coins {
+		for j := coin; j <= amount; j++ {
+			dp[j] = min(dp[j], dp[j-coin]+1)
+		}
+	}
+	if dp[amount] > amount {
+		return -1
+	}
+	return dp[amount]
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+```
+
 <!-- tabs:end -->

solution/0300-0399/0322.Coin Change/Solution.go

@@ -0,0 +1,22 @@
+func coinChange(coins []int, amount int) int {
+	dp := make([]int, amount+1)
+	for i := 1; i <= amount; i++ {
+		dp[i] = amount + 1
+	}
+	for _, coin := range coins {
+		for j := coin; j <= amount; j++ {
+			dp[j] = min(dp[j], dp[j-coin]+1)
+		}
+	}
+	if dp[amount] > amount {
+		return -1
+	}
+	return dp[amount]
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}