Java 动态规划与递归实现 find change problem, maximum value problem

    package package1;
    
    import java.util.Random;
    
    class Coin {
    int monly;
    int num;
    
    public Coin(int monly, int num) {
        this.monly = monly;
        this.num = num;
    }
    }
    
    public class alg {
    
    public static int maxCoin(int[] n) {
        int a = 0, b = n[0], c = 0;
        for (int i = 1; i < n.length; i++) {
            c = Math.max(a + n[i], b);
            a = b;
            b = c;
        }
        return c;
    }
    
    /** * @param n        硬币
     * @param isChoose 前一个数是否使用
     * @param poin