计算斐波那契数列的算法
public class Fib {
static int f(int k) {
if (k <= 2) {
return 1;
} else {
return f(k - 2) + f(k - 1);
}
}
public static void main(String[] args) {
System.out.println("请输入斐波那契数列的个数:");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
System.out.println("前" + n + "个数的斐波那契的数列:");
for (int i = 0; i <= n; i++) {
System.out.println(f(i) + "\t");
}
}
}
执行结果
前8个数的斐波那契的数列:
1
1
1
2
3
5
8
13
21