📄 recursion.java
字号:
import java.io.*;
public class recursion {
static long fibonacci(int n) {
if (n == 0 || n == 1)
return n;
else
return (fibonacci(n - 1) + fibonacci(n - 2));
}
public static void main(String[] args) {
int n = 0;
String s = "";
System.out.print("请输入要求的菲波那契数列的项:");
try {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
s = br.readLine();
n = Integer.parseInt(s);
}
catch (Exception e) {
System.out.println(e.toString());
}
System.out.println("第" + n + "项的菲波那契数列为" + fibonacci(n));
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -