coding interviews 07 斐波那契数列

public static int Fibonacci(int n) {
    
    if(n==0){
        return 0;
    }

    //if n = 1 or 2 return
    //else recursion
    if(n == 1 || n == 2){
        return 1;
    }else{
        return Fibonacci(n-1)+Fibonacci(n-2);
    }

}