import java.util.Scanner;
public class digui {
public static void main(String[] args) {
System.out.println("n:");
Scanner sc=new Scanner(System.in);
int n= sc.nextInt();
System.out.println("F(n)="+fibonacci(n));
}
public static int fibonacci(int n) {
if(n<=1)return 1;
return fibonacci(n-1)+fibonacci(n-2);
}
}
无穷数列 1,1,2,3,5,8,13,21,34,55,… 称为Fibonacci数列。它可以递归地定义为F(n)={ 1,F(n−1)+F(n−2) n=0,1n>1
最新推荐文章于 2022-11-11 09:28:26 发布