【完全背包问题】完全背包问题计算方案数的经典例题了属于是。
class Solution {
// 完全背包问题 21:40
public int change(int amount, int[] coins) {
int[] dp = new int[amount + 1];
dp[0] = 1;
int n = coins.length;
for (int i = 1; i <= n; i++) {
int c = coins[i - 1];
for (int j = c; j <= amount; j++) {
dp[j] += dp[j - c];
}
}
return dp[amount];
}
}