/
- java 递归实现斐波拉契数列,输出斐波拉契数列,给定一个n
- 生成斐波拉契数列
- 1.首先要算出F(n),加入到ArrayList
- 2.算出F(n-2),F(n-1)加入到ArrayList
- 3.F(1)=1,F(0)=0,加入到ArrayList
- 4.打印ArrayList
- @author GalaxyForest
/
/**
*分析:0,1,1,2,3,5,8,13…
*F(0)=0
*F(1)=1
*n>=2时,F(n)=F(n-1)+F(n-2)
*/
public class FeiBolaqi {
public int toGetFn(int n) {
int value=0;
if (n==0) {`在这里插入代码片`
value = 0;
return value;
}
if (n==1) {
value = 1;
return value;
}
if (n>=2) {
value = toGetFn(n-1)+toGetFn(n-2);
}
return value;
}
void appendAndShowArrayList(FeiBolaqi feiBolaqi,int n) {
// TODO Auto-generated method stub
ArrayList arraylist = new ArrayList();
for(int i=0;i<=n;i++){
arraylist.add(feiBolaqi.toGetFn(i));
}
System.out.println(arraylist);
}
public static void main(String[] args) {
FeiBolaqi feiBolaqi = new FeiBolaqi();
System.out.println("请输入斐波拉契数列最后一个数对应的项数(下标从0开始):");
Scanner scanner = new Scanner(System.in);
feiBolaqi.appendAndShowArrayList(feiBolaqi, scanner.nextInt());
}
}