利用到了ArrayList类
步骤:输入正整数,打印出数列对应位置值,以及从1到该位的斐波拉契数列
import java.util.Scanner;
import java.util.ArrayList;
public class recursionExercise {
public static void main(String[] args) {
Scanner my = new Scanner(System.in);
F f1 = new F();
int cou = my.nextInt(); //接收输入的整数值
int fina = f1.fibonacci(cou); //输入数n位对应斐波拉契数列的数
System.out.print("斐波拉契数列第n位值:");
System.out.println(fina);
f1.show(cou); //输出斐波拉契数列
}
}
class F {
//请用递归的方式求出,斐波拉契数1,1,2,3,5,8,13......给一个数位n,求出值是多少
// int[] array = {};
ArrayList<Integer> array = new ArrayList<>();
public int fibonacci(int n) {
if (n == 1 || n == 2) {
return 1;
} else {
return fibonacci(n - 2) + fibonacci(n - 1);
}
}
public void show(int n) {
for (int i = 1; i <= n; i++) {
this.array.add(this.fibonacci(i));
}
System.out.print("n位对应的斐波拉契数列:");
for (int i :
array) {
System.out.print(i + " ");
}
}
}