Question

java编程：用非递归调用的方法解决Fibonacci数列，求Fibonacci数列的第四十项

Answer 1

public class Fibonacci1 {

public static long fib(int n) {
long f1 = 1, f2 = 1;
long m = 0;
if(n <= 2) {
return 1;
} else {
for(int i = 3; i <= n; i++) {
m = f1 + f2;
f2 = f1;
f1 = m;
}
return m;
}
}
public static void main(String [] args) {
long m = fib(40);
System.out.println("Fibonacci(40) is " + m);
}
}

Answer 2

//写一小程序，非递归方法，可以输入一个参数，求出任意位Fibonacci数列
import java.util.Scanner;

public class Fibonacci {
public static void main(String[] args) {
int a=1 , b=1 , f=0 ;
System.out.println("请输入你要求的数列数：");
//获取一个输入
Scanner cin=new Scanner(System.in);
int m = cin.nextInt();
for(int i = 1; i < m-1; i++){
f = a + b;
a = b;
b = f;
}
System.out.println(f);
}
}

Answer 3

利用循环来解决的：
public class Fibonacci {

public static void main(String[] args) {
int num = 40;
int[] ary = getFibonacci(num);

int fib40 = ary[ary.length - 1];
System.out.println("Fib(" + num + ") = " + fib40);
}

private static int[] getFibonacci(int num) {

final int[] ary = new int[num];

for(int i = 0; i < ary.length; i++){
if(i <= 1){
ary[i] = 1;
}else{
ary[i] = ary[i-1] + ary[i -2];
}
}

return ary;

}

}

-----------------------
Fib(40) = 102334155

Answer 4

有递归你不用,你傻吗?

追问

汗 题目必须要用非递归