二阶斐波那契（Fibonacci）数列问题的记录

函数定义 fib(n) = 0 (n = 0) / fib(n) = 1 (n = 1) / fib(n) = fib(n - 1) + fib(n - 2)

解：

public class Fibonacci {

    public static void main(String[] args) {
        for (int i = 0 ;i < 10 ;i++){
            System.out.println(" " + fib(i) + " ");
        }
    }

    public static int fib(int n){
        if (n == 0){
            return 0;
        }else if (n == 1){
            return 1;
        }else{
            return fib(n-1)+fib(n-2);
        }
    }
}