力扣-12.17-518

class Solution {
    public int change(int amount, int[] coins) {
        if(coins == null) {
			return 0;
		}
		int len = coins.length;
		int[] dp = new int[amount + 1];
		dp[0] = 1;
		for(int coin : coins) {
			for(int i = coin; i <= amount; i++) {
				dp[i] += dp[i - coin];
			}
		}
		return dp[amount];
    }
}