dfs
暴力超时,同时,我们这个因为测试样例卡的很死,我们在使用sum 加的时候出现了整数溢出,所以爆栈了
class Solution {
int res = Integer.MAX_VALUE;
public int coinChange(int[] coins, int amount) {
dfs(coins,amount,0,0);
if(res == Integer.MAX_VALUE){
return -1;
}
return res;
}
public void dfs(int[] coins,int amount,int sum,int count){
if(sum > amount){
return;
}
if(sum == amount){
res = Math.min(res,count);
return;
}
for(int i = 0;i < coins.length;i++){
dfs(coins,amount,sum + coins[i],count + 1);
}
}
}
动态规划
class Solution {
public int coinChange(int[] coins, int amount) {
// 表示的是当前的最大
if(coins.length == 0) return -1;
int [] dp = new int[amount + 1];
Arrays.fill(dp,amount + 1);
dp[0] = 0;
// 完全背包的组合问题 先背包,后重量顺序
for(int i = 0;i < coins.length;i++){
for(int j = coins[i];j <= amount;j++){
dp[j] = Math.min(dp[j],dp[j - coins[i]] + 1);
}
// System.out.println(Arrays.toString(dp));
}
if(dp[amount] == amount + 1){
return -1;
}else{
return dp[amount];
}
}
}
class Solution {
public int numSquares(int n) {
int max = Integer.MAX_VALUE;
int[] dp = new int[n + 1];
Arrays.fill(dp,n + 1);
dp[0] = 0;
for(int i = 0;i <= n;i++){
for(int j =1;j*j <= i;j++){
dp[i] = Math.min(dp[i],dp[i - j*j] + 1);
}
}
return dp[n];
}
}