public class RecursiveFibonacci {
//斐波那契数:1,1,2,3,5,8,13...
public static int rF (int number) {
//第一和第二个数是1
if (number == 1 || number == 2) {
return 1;
}else {
//从第三个开始,后一个是前两个的和
return rF(number - 1) + rF(number - 2);
}
}
}