public class coinmax {
static int[] c = {1,5,10,20,50,100};
static int n=c.length-1;
static int[] a = new int[n+1];
static int[] f = new int[n+1];
static int[] arr = new int[n+1];
public static void main(String[] args) {
System.out.print("递归法求得结果为:" + fun1(n));
System.out.print("\n备忘录法求得结果为:" + fun2(n));
System.out.print("\n动态规划法求得结果为:");
coinRow(n);
System.out.println(f[n ]);
int count = 0;
for (int i = n; i >= 1 ; i--) {
if (f[i] == f[i - 1])
{
arr[count++] = c[--i];
} else {
arr[count++] = c[i--];
}
}
System.out.println("拿的面额分别为");
for (int i = n; i >= 0; i--) {
if(arr[i] > 0)
System.out.print(arr[i] + "\t");
}
}
//普通递归求
static int fun1(int n) {
if (n == 0)
return c[0];
if (n == 1)
return Math.max(c[0], c[1]);
else
return Math.max(c[n] + fun1(n - 2), fun1(n - 1));
}
//备忘录
static int fun2(int n) {
if (n == 0)
return c[0];
if (n == 1)
return Math.max(c[0], c[1]);
else if (a[n] != 0)
return a[n];
return a[n] = Math.max(c[n] + fun2(n - 2), fun2(n - 1));
}
//动态规划法求
static void coinRow(int n) {
f[0] = 0;
f[1] = c[1];
for (int i = 2; i <= n; i++) {
f[i] = Math.max(c[i] + f[i-2], f[i-1]);
}
}
}
最大币值问题
于 2022-04-10 15:28:46 首次发布