class Solution {
public int coinChange(int[] coins, int amount) {
int n = coins.length;
int[] arr = new int[amount + 1];
Arrays.fill(arr,amount + 1);
arr[0] = 0;
for(int i = 1;i <= amount;i++){
for(int j = 0;j < n;j++){
if(coins[j] <= i){
arr[i] = Math.min(arr[i - coins[j]] + 1,arr[i]);
}
}
}
return arr[amount] > amount ? -1 : arr[amount];
}
}
力扣之兑换硬币,动态规划
最新推荐文章于 2024-03-27 21:00:00 发布