非递归法实现斐波那契数列,套用斐波纳契数列的通项F(n)=F(n-1)+F(n-2)通过循环实现
import java.util.Scanner;
public class project1 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int a = scan.nextInt();
int[] b = new int[101];
b[0] = 1;
b[1] = 1;
for(int i = 0;i < a;i++) {
if(i > 1) {
b[i] = b[i - 2] + b[i - 1];
}
System.out.print(b[i] + "\t");
}
}
}