硬币拆分(动态规划)

定义dp(i)的意义
设置dp(0)的值//边界
确定dp(i)和dp(i-x)的关系(x为题目给的)

public class CoinChange {
	static public int coin(int n) {//递归,最原始
        if (n < 1) {
            return Integer.MAX_VALUE;
        }
        if (n == 1 || n == 5 || n == 20 || n == 25) {
            return 1;
        }
        int mincoin = Math.min(Math.min(coin(n - 1), coin(n - 5)), Math.min(coin(n - 20), coin(n - 25)));
        return mincoin + 1;
    }

	static public int coin3(int n){//递推,自下向上
        int[] count=new int[n+1];

        for(int i=1;i<=n;i++){
            int min=Integer.MAX_VALUE;
            if (i >= 1) {
                min=Math.min(count[i-1],min);
            }
            if (i >= 5) {
                min=Math.min(count[i-5],min);
            }
            if (i >= 20) {
                min=Math.min(count[i-20],min);
            }
            if (i >= 25) {
                min=Math.min(count[i-25],min);
            }
            count[i]=min+1;
        }
        return count[n];
    }

	static public int coin2(int n) {//递归,自上向下,用数组保存,减少运算量
        int[] c = new int[n + 1];
     //   c[1] = c[5] = c[20] = c[25] = 1;//数组越界
        int[] face={1,5,20,25};
        for (int i : face) {
            if(i<=n){
                c[i]=1;
            }
        }
        return coin2(n,c);
    }

    static public int coin2(int n, int[] c) {
        if (n < 1) {
            return Integer.MAX_VALUE;
        }
        if (n == 1 || n == 5 || n == 20 || n == 25) {
            return c[n];
        }
        return Math.min(Math.min(coin2(n - 1, c), coin2(n - 5, c)), Math.min(coin2(n - 20, c), coin2(n - 25, c))) + 1;
    }
    public static void main(String[] args) {
        System.out.println(coin(41));
        System.out.println(coin2(41));
        System.out.println(coin3(41));
    }
}