1class Solution {2    public int coinChange(int[] coins, int amount) {3        int[] dp = new int[amount + 1];4        Arrays.fill(dp, amount + 1);5        dp[0] = 0;6        for (int x = 1; x <= amount; x++) {7            for (int coin : coins) {8                if (coin <= x) dp[x] = Math.min(dp[x], dp[x - coin] + 1);9            }10        }11        return dp[amount] > amount ? -1 : dp[amount];12    }13}