代码随想录day39：动态规划part7，完全背包继续

day39：动态规划part7，完全背包

爬楼梯进阶版

https://kamacoder.com/problempage.php?pid=1067

import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt()) {
            int n = in.nextInt();
            int m = in.nextInt();
            int[] dp = new int[n + 1];
            dp[0] = 1;
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++)
                    if (i >= j)
                        dp[i] += dp[i - j];
            }
            System.out.println(dp[n]);
        }
    }
}

322.零钱兑换

class Solution {
    public int coinChange(int[] coins, int amount) {
        // dp[j]：凑成总额为j的硬币最少个数
        int[] dp = new int[amount + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;
        for (int i = 0; i < coins.length; i++) {
            for (int j = coins[i]; j <= amount; j++)
                if (dp[j - coins[i]] != Integer.MAX_VALUE)
                    // 注意 Integer.MAX_VALUE + 1 会爆栈，必须跳过
                    dp[j] = Math.min(dp[j], dp[j - coins[i]] + 1);
        }
        return dp[amount] == Integer.MAX_VALUE ? -1 : dp[amount];
    }
}

279.完全平方数

class Solution {
    public int numSquares(int n) {
        // dp[i]：和为i的完全平方数的最少数量为dp[i]
        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;
        for (int i = 1; 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];
    }
}