leetcode322. 零钱兑换

class Solution {
    public int coinChange(int[] coins, int amount) {
        int[] f = new int[amount+1];
        for(int i = 1;i <= amount;i++){
            int minNum = Integer.MAX_VALUE;
            for(int j = 0;j < coins.length;j++){
                if(i - coins[j] >= 0)
                    minNum = Math.min(minNum,f[i - coins[j]]);
            }
            if(minNum == Integer.MAX_VALUE)
                f[i] = Integer.MAX_VALUE;
            else
                f[i] = minNum + 1;
        }

        return f[amount] == Integer.MAX_VALUE ? -1 : f[amount];
    }
}