Java中的Fibonacci系列程序使用递归。
以下是必需的程序。
示例
public class Tester {
static int n1 = 0, n2 = 1, n3 = 0;
static void fibbonacci(int count) {
if (count > 0) {
n3 = n1 + n2;
n1 = n2;
n2 = n3;
System.out.print(" " + n3);
fibbonacci(count - 1);
}
}
public static void main(String args[]) {
int count = 5;
System.out.print(n1 + " " + n2);
fibbonacci(count - 2);
}
}输出结果
0 1 1 2 3