coin change 322

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:

Input: coins = [1, 2, 5], amount = 11
Output: 3 
Explanation: 11 = 5 + 5 + 1
Example 2:

Input: coins = [2], amount = 3
Output: -1
Note:
You may assume that you have an infinite number of each kind of coin.

//勉强通过
class Solution {
    public int coinChange(int[] coins, int amount) {
        
        int f[][]=new int[coins.length+1][amount+1];
        
        for(int i=1;i<=amount;i++)
        {
            if(coins[0]>i)
            {
                f[1][i]=Integer.MAX_VALUE;
            }
            else
            {
                if(i%coins[0]==0)
                {
                    f[1][i]=i/coins[0];
                }
                else
                {
                    f[1][i]=Integer.MAX_VALUE;
                }
            }
        }
        
        for(int i=1;i<=coins.length;i++)
        {
            f[i][0]=0;
        }
        
        for(int i=2;i<=coins.length;i++)
        {
            for(int j=0;j<=amount;j++)
            {
                
                int min=Integer.MAX_VALUE;
                for(int q=0;q<=j/coins[i-1];q++)
                {
                   
                    if(f[i-1][j-q*coins[i-1]]!=Integer.MAX_VALUE&&(min>f[i-1][j-q*coins[i-1]]+q))
                    {
                        min=f[i-1][j-q*coins[i-1]]+q;
                    }
                }
                f[i][j]=min;
                
            }
        }
        
        if(f[coins.length][amount]==Integer.MAX_VALUE)
        {
            return -1;
        }
        else
        {
            return f[coins.length][amount];
        }
        
        
        
    }
}

import java.util.Arrays;//
import java.util.Collections;

class Solution {

    private int minCoin[]=null;//存储i时的最小硬币数量
    public int coinChange(int[] coins, int amount) {

        minCoin=new int[amount+1];

        

        Arrays.fill(minCoin,-2);
        return coinCount(coins,amount);

    }

    public int coinCount(int[] coins,int amount)
    {   //System.out.println(amount);
        if(amount<0)
        {
            return -1;
        }

        if(minCoin[amount]!=-2)
        {
            return minCoin[amount];
        }
        else
        {
            if(amount==0)
            {
                minCoin[amount]=0;
                return 0;
            }

            int minValue=Integer.MAX_VALUE;
            for(int i=0;i<coins.length;i++)
            {
                //System.out.println(amount-coins[i]);
                int childValue=coinCount(coins,amount-coins[i])+1;
                //System.out.println("&&"+childValue+"&&");
                if(childValue!=0)
                {
                    if(minValue>childValue)
                    {
                        minValue=childValue;

                    }

                }

            }
            if(minValue==Integer.MAX_VALUE)
            {
                minCoin[amount]=-1;
                return -1;
            }
            else
            {
                minCoin[amount]=minValue;
                return minValue;
            }

        }
    }

    public static void main(String [] args)
    {
        Solution solution=new Solution();
        int []coins={1,2,5};
        int amount=11;
        int result=solution.coinChange(coins,amount);

        System.out.print(result);




    }

}