public class RecursionExercise01{
public static void main(String[] args) {
T t1 = new T();
int n = 10;
int res = t1.fibonacci(n);
if(res != -1){
System.out.println("当n=" + n + " 对应的斐波那契数列=" + res);
}
}
}
class T {
public int fibonacci(int n){
if(n >= 1){
if( n == 1 || n == 2){
return 1;
} else {
return fibonacci(n - 1) + fibonacci(n - 2);
}
} else {
System.out.println("要求输入的n>=1的整数");
return -1;
}
}
}