斐波那契数列:0,1,1,2,3,5,8…
public class Fibonacci{
public int Fibonacci(int n) {
if(n == 0){
return 0;
}
if(n == 1){
return 1;
}
return Fibonacci(n-1)+Fibonacci(n-2);
}
}
斐波那契数列:0,1,1,2,3,5,8…
public class Fibonacci{
public int Fibonacci(int n) {
if(n == 0){
return 0;
}
if(n == 1){
return 1;
}
return Fibonacci(n-1)+Fibonacci(n-2);
}
}