1114-1
代码:
- class Solution {
- public int change(int amount, int[] coins) {
- int n = amount;
- int[] dp = new int[n+1];
-
- dp[0]=1;
- for(int coin:coins){
- for(int i=1;i<=n;i++){
- if(i-coin>=0){
- dp[i] += dp[i-coin];
- }
- }
- }
- return dp[n];
- }
- }