update a solution

Author: Kyle Liu

lcof/of037/Solution_test.go

@@ -12,6 +12,6 @@ func TestSolution(t *testing.T) {
 	//ser := Constructor();
 	deser := Constructor()
 	//data := ser.serialize(root);
-	ans := deser.deserialize("1")
+	ans := deser.deserialize("1,nil,nil")
 	fmt.Println(ans)
 }

leetcode/301-400/0322.Coin-Change/Solution.go

@@ -1,5 +1,7 @@
 package Solution
 
+import "math"
+
 func coinChange(coins []int, amount int) int {
 	dp := make([]int, amount+1)
 	for i := 0; i < amount+1; i++ {
@@ -11,6 +13,7 @@ func coinChange(coins []int, amount int) int {
 		for j := 0; j < len(coins); j++ {
 			if coins[j] <= i {
 				dp[i] = min(dp[i], dp[i-coins[j]]+1)
+
 			}
 		}
 	}
@@ -26,3 +29,54 @@ func min(x, y int) int {
 	}
 	return x
 }
+
+//动态规划（不压缩空间）
+func coinChange2(coins []int, amount int) int {
+	dp := make([][]int, len(coins)+1) //定义状态
+	for i := 0; i <= len(coins); i++ {
+		dp[i] = make([]int, amount+1)
+	}
+	//初始条件
+	for j := 0; j <= amount; j++ {
+		dp[0][j] = amount + 1
+	}
+	dp[0][0] = 0
+	for i := 1; i <= len(coins); i++ {
+		for j := 0; j <= amount; j++ {
+			//状态转移方程
+			if j >= coins[i-1] {
+				dp[i][j] = int(math.Min(float64(dp[i-1][j]), float64(dp[i][j-coins[i-1]]+1)))
+			} else {
+				dp[i][j] = dp[i-1][j]
+			}
+		}
+	}
+	if dp[len(coins)][amount] > amount {
+		return -1
+	} else {
+		return dp[len(coins)][amount]
+	}
+}
+
+//动态规划（压缩空间）
+func coinChange3(coins []int, amount int) int {
+	dp := make([]int, amount+1)
+	//初始值
+	for i := 0; i <= amount; i++ {
+		dp[i] = amount + 1
+	}
+	dp[0] = 0
+
+	for i := 1; i <= len(coins); i++ {
+		for j := 0; j <= amount; j++ {
+			if j >= coins[i-1] {
+				dp[j] = int(math.Min(float64(dp[j]), float64(dp[j-coins[i-1]]+1)))
+			}
+		}
+	}
+	if dp[amount] > amount {
+		return -1
+	} else {
+		return dp[amount]
+	}
+}

leetcode/301-400/0322.Coin-Change/Solution_test.go

@@ -12,6 +12,8 @@ type SolutionFuncType func([]int, int) int
 
 var SolutionFuncList = []SolutionFuncType{
 	coinChange,
+	coinChange2,
+	coinChange3,
 }
 
 //	test info struct