Leetcode - Coin Change 2

violet posted @ 5 年前 in 算法 with tags Algorithm DP Golang , 440 阅读

https://leetcode.com/problems/coin-change-2/

You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite number of each kind of coin.

Example 1:

Input: amount = 5, coins = [1, 2, 5]
Output: 4
Explanation: there are four ways to make up the amount:
5=5
5=2+2+1
5=2+1+1+1
5=1+1+1+1+1

func change(amount int, coins []int) int {
    dp := make([]int, amount+1)
    dp[0] = 1
    for _, c := range coins {
        for i := 1; i <= amount; i++ {
            if i >= c {
                dp[i] += dp[i-c]
            }
        }
    }
    return dp[amount]
}