Coin Change 2

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

Return the number of combinations that make up that amount. If that amount of money cannot be made up by any combination of the coins, return 0.

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

The answer is guaranteed to fit into a 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

思路：背包问题，可以用无数多的coin，二维dp，dp[i][j]表示，可以用前i种硬币，组成amount是j的种类有多少；

dp[][] = new int[coins.length + 1][amount + 1];

dp[i][j] = 不用ith dp[i - 1][j] + 用ith coin dp[i][j - coins[i - 1]]; 

你只要用了ith coin，那么就可以用j - coins[i - 1]的amount的状态来计算，因为我只要知道你最后一个ith coin有多少种来的就可以了；

class Solution {
    // dp[i][j];
    // don't use ith type coin, dp[i][j] += dp[i - 1][j];
    // use ith type coin, dp[i][j] += dp[i][j - coins[i - 1]]
    // 你只要用了ith coin，那么就可以用j - coins[i - 1]的amount的状态来计算，因为我只要知道你最后一个ith coin有多少种来的就可以了；
    public int change(int amount, int[] coins) {
       int[][] dp = new int[coins.length + 1][amount + 1];
        dp[0][0] = 1;
        for(int i = 1; i <= coins.length; i++) {
            dp[i][0] = 1;
            for(int j = 1; j <= amount; j++) {
                dp[i][j] += dp[i - 1][j];
                if(j - coins[i - 1] >= 0) {
                    dp[i][j] += dp[i][j - coins[i - 1]];
                }
            }
        }
        return dp[coins.length][amount];
    }
}