斐波那契数列
斐波那契数列又称黄金分割列数,指的是这样一个数列“ 0, 1, 1, 2, 3, 5, 8, 13, 21, …
import java.util.Scanner;
class Demo01
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
System.out.println("请输入你要打印的第几个斐波那契数:");
int n = sc.nextInt();
System.out.println("第" + n + "个斐波那契数是" + fun(n));
}
public static int fun(int n) {
if (n == 1) {
return 0;
}
if (n == 2) {
return 1;
}
return fun(n - 1) + fun(n - 2);
}
}