322. Coin Change

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

Example 1:
coins = [1, 2, 5], amount = 11
return 3 (11 = 5 + 5 + 1)

Example 2:
coins = [2], amount = 3
return -1.

Note:
You may assume that you have an infinite number of each kind of coin.

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

背包问题

public class Solution {
    private int [] list ;
    private int cal(int[] coins,int amount){
        if(amount==0)return 0;
        
        if(list[amount]!=0)return list[amount];
        if(amount<coins[0]){
            list[amount]=-1;
            return -1;
        }
        int ret = -1;
        for(int i=coins.length-1;i>=0;i--){//注意此处不能把i放在cal参量里了，不然list的值可能是错的
            if(coins[i]>amount)continue;
            int tem =cal(coins,amount-coins[i]);
            if(tem==-1)continue;
            if(ret==-1)ret=tem+1;
            if(tem+1<ret)ret=tem+1;
        }
        list[amount]=ret;
        return ret;
    }
    public int coinChange(int[] coins, int amount) {
        if(amount==0)return 0;
        if(coins.length==0)return -1;
        list = new int [amount+1];
        Arrays.sort(coins);
        return cal(coins,amount);
    }
}