硬币组法问题

有1元 5元 10元 25元 的硬币
输入一个整数 判断有多少钟组法

package 递归.递归进阶;

public class 硬币组发 {

    public static void main(String[] args) {

//        for (int i = 1; i < 101; i++) {
//        }


        int ways = countWays(4);
        System.out.println(4 + "---" + ways);

    }


    /*递归形式*/
    private static int countWays(int n) {
        if (n <= 0)
            return 0;
        return countWaysCore(n, new int[]{1, 5, 10, 25}, 3);
    }

    private static int countWaysCore(int n, int[] coins, int cur) {

        //出口
        if (cur == 0) {
            return 1;
        }


        //不选coins[cur]
        //要一个
        //要两个
        int res = 0;

        for (int i = 0; i * coins[cur] <= n; i++) {
            int shengyu = n - i * coins[cur];
            System.out.println(i * coins[cur]);
            System.out.println("shengyu" + shengyu);
            System.out.println("cur" + cur);
            res += countWaysCore(shengyu, coins, cur - 1);
        }


        return res;
    }

}