 # Dynamic Programming - 322. Coin Change

1. Coin Change

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return `-1`.

Example 1:

Input: coins = [1, 2, 5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1

Example 2:

Input: coins = , amount = 3
Output: -1

Note:
You may assume that you have an infinite number of each kind of coin.

go：

``````func coinChange(coins []int, amount int) int {

dp := make([]int, amount+1)
n := len(coins)

// initialization
dp = 0;

for i := 1; i <= amount; i++ {
dp[i] = math.MaxInt32
for j := 0; j < n; j++ {
if i >= coins[j] {
dp[i] = min(dp[i - coins[j]] + 1, dp[i])
}
}
}

if dp[amount] == math.MaxInt32 {
dp[amount] = -1
}

return dp[amount]
}

func min(i, j int) int {
if i < j {
return i
}
return j
}
``````

Nothing just happens, it's all part of a plan.