斐波那契数列的实现(java版)
public class Fibonacci_polynomial {
public static final int N = 11;
//用一个数组来存储每次计算的值,这样就能减少每次计算的量
private static int array[] = new int[N];
private static int fib(int n) {
if(n==1 || n==0) {
return 1;
}
if(array[n] == 0) {
array[n] = fib(n-1) + fib(n-2);
}
return array[n];
}
public static void main(String[] args) {
System.out.println("请输入整数n:");
int n = 10;
System.out.println(fib(n));
}
}