Java 实例 - 斐波那契数列

斐波那契数列指的是这样一个数列 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368……

特别指出:第0项是0,第1项是第一个1。

这个数列从第三项开始,每一项都等于前两项之和。

以下实例演示了 Java 斐波那契数列的实现:

MainClass.java 文件

  1. public class MainClass {
  2. public static long fibonacci(long number) {
  3. if ((number == 0) || (number == 1))
  4. return number;
  5. else
  6. return fibonacci(number - 1) + fibonacci(number - 2);
  7. }
  8. public static void main(String[] args) {
  9. for (int counter = 0; counter <= 10; counter++){
  10. System.out.printf("Fibonacci of %d is: %d\n",
  11. counter, fibonacci(counter));
  12. }
  13. }
  14. }

以上代码运行输出结果为:

  1. Fibonacci of 0 is: 0
  2. Fibonacci of 1 is: 1
  3. Fibonacci of 2 is: 1
  4. Fibonacci of 3 is: 2
  5. Fibonacci of 4 is: 3
  6. Fibonacci of 5 is: 5
  7. Fibonacci of 6 is: 8
  8. Fibonacci of 7 is: 13
  9. Fibonacci of 8 is: 21
  10. Fibonacci of 9 is: 34
  11. Fibonacci of 10 is: 55