Leetcode 322, Coin Change

public int coinChange(int[] coins, int amount) {
        int[] dp = new int[amount + 1];//12
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;
         
        for (int i = 1; i <= amount; i++) {
            for (int j = 0; j < coins.length; j++) {
                if (coins[j] <= i) {
                    if (dp[i - coins[j]] != Integer.MAX_VALUE) {
                        dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1);
                    }
                }
            }
        }
         
        return dp[amount] == Integer.MAX_VALUE ? -1 : dp[amount];
    }

refer: http://buttercola.blogspot.com/2016/01/leetcode-coin-change.html