leetcode:零钱兑换

给定不同面额的硬币 coins 和一个总金额 amount。编写一个函数来计算可以凑成总金额所需的最少的硬币个数。如果没有任何一种硬币组合能组成总金额，返回 -1。

示例 1:

输入: coins = [1, 2, 5], amount = 11
输出: 3
解释: 11 = 5 + 5 + 1
示例 2:

输入: coins = [2], amount = 3
输出: -1

class Solution {
    public int coinChange(int[] coins, int amount) {
        int n = coins.length;
        if (n == 0 ) return -1;
        if (amount ==0 ) return 0;
        int[] dp = new int[amount + 1];
        for (int i = 0; i < n; i++) {
            if (coins[i] <= amount)
                dp[coins[i]] = 1;
        }
        for (int i = 1; i <= amount; i++) {
            dp[i] = Integer.MAX_VALUE-1;
            for (int coin : coins) {
                if (coin <= i) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }
        if (dp[amount] == Integer.MAX_VALUE-1) return -1;
        return dp[amount];
    }
}