518. 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.

Note: You can assume that

• 0 <= amount <= 5000
• 1 <= coin <= 5000
• the number of coins is less than 500
• the answer is guaranteed to fit into signed 32-bit integer

 

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

 

Example 2:

Input: amount = 3, coins = [2]
Output: 0
Explanation: the amount of 3 cannot be made up just with coins of 2.

 

Example 3:

Input: amount = 10, coins = [10] 
Output: 1

方法一：DFS求解，TLE，程序如下所示：

class Solution {
    private int cnt = 0;
    public int change(int amount, int[] coins) {
        if (coins.length == 0){
            return amount == 0?1:0;
        }
        Arrays.sort(coins);
        dfs(coins, 0, amount);
        return cnt;
    }
    public void dfs(int[] coins, int begin, int amount){
        if (begin >= coins.length || amount < 0){
            return ;
        }
        if (amount == 0){
            cnt ++;
            return;
        }
        for (int i = begin; i < coins.length; ++ i){
            if (amount - coins[i] < 0){
                return;
            }
            dfs(coins, i, amount - coins[i]);
        }
    }
}

方法二：DP求解：

class Solution {
    public int change(int amount, int[] coins) {
        int[] ways = new int[amount + 1];
        ways[0] = 1;
        for (int val : coins){
            for (int i = val; i <= amount; ++ i){
                ways[i] += ways[i - val];
            }
        }
        return ways[amount];
    }
}