322. Coin Change

class Solution {
    public int coinChange(int[] coins, int amount) {
        int max = amount + 1;
        int[] dp = new int[max];
        Arrays.fill(dp, max);
        dp[0] = 0;
        
        for (int i = 1; i <= amount; i++) {
            for (int j = 0; j < coins.length; j++) {
                if (coins[j] <= i) {
                    dp[i] = Math.min(dp[i], dp[i-coins[j]] + 1);
                }
            }
        }
        
        return dp[amount] > amount ? -1 : dp[amount];
    }
}

Runtime: 20 ms, faster than 39.09% of Java online submissions for Coin Change.
Memory Usage: 41.4 MB, less than 11.09% of Java online submissions for Coin Change.
dp 진짜 연습 좀 하자..