public class three {
public static void main(String[] args) {
int[] F = new int[40];
int j = 0;
F[0] = 1;
F[1] = 1;
for (int i = 2; i < F.length; i++) {
F[i] = F[i - 1] + F[i - 2];
}
for (int b : F) {
System.out.println(b);
}
}
}
任务描述求Fibonacci数列的前40个数。即F0=0,F1=1,Fn=F(n-1)+F(n-2)(n>=2,n∈N*)public class three { public static void main(String[] args) { int[] F = new int[40]; int j = 0; F[0] = 1; F[1] = 1; for (in...