FibonacciArr.java import java.util.Scanner;public class FibonacciArr {/** * 斐波那契数列 * @param args */ public int FibonacciArr(int n) { if(n=0){ return 0; } else{ int m =39; int[] f = new int[m]; f[0]=f[1]=1; for(int i =2;i
import java.util.Scanner;
public class FibonacciArr {
/**
* 斐波那契数列
* @param args
*/
public int FibonacciArr(int n) {
if(n<=0){
return 0;
}
else{
int m =39;
int[] f = new int[m];
f[0]=f[1]=1;
for(int i =2;i
