java 动态规划,递归实现 找零问题,币值最大化
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;
}
public static int recMaxCoin_(int[] n, boolean isChoose, int point, int monly) {
if (point == n.length) {
return monly;
} else if (isChoose) {
return recMaxCoin_(n, false, point + 1, monly);
} else {