【代码随想录Day45动态规划part07】70.爬楼梯\322.零钱兑换\279.完全平方数

Day45

70.爬楼梯

class Solution {
  public int climbStairs(int n) {
       int dp[] = new int[n + 1];
       dp[0] = 1;
       for (int j = 0; j <= n; j++) {
           for (int i = 1; i <= 2; i++) {
               if (j >= i) {
                   dp[j] += dp[j - i];
               }
           }
       }
       return dp[n];
    }
}

322.零钱兑换

class Solution {
     public int coinChange(int[] coins, int amount) {

        int dp[] = new int[amount + 1];
        dp[0] = 0;
        for (int i = 1; i <= amount; i++) dp[i] = 10001;
        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);
            }
        }
        return dp[amount] == 10001 ? -1 : dp[amount] ;
    }
}

279.完全平方数

class Solution {
    public int numSquares(int n) {
        int dp[] = new int[n + 1];
        for (int i = 0; i < dp.length; i++) dp[i] = Integer.MAX_VALUE;
        dp[0] = 0;
        for (int i = 1; i * i <= n; i++) {
            for (int j = i * i; j <= n; j++) {
                if (dp[j - i * i] == Integer.MAX_VALUE) continue;
                dp[j] = Math.min(dp[j], dp[j - i * i] + 1);
            }
        }
        return dp[n];
    }
}