//用递归的方式求斐波那契数 1 1 2 3 5 8 13 ...
//给个n,求第n个数的值
import java.util.Scanner;
public class Recursion01{
public static void main(String[] args){
//用递归的方式求斐波那契数 1 1 2 3 5 8 13 ...
//给个n,求第n个数的值
Scanner sc = new Scanner(System.in);
int sum,n;
System.out.println("请输入n的值:");
n = sc.nextInt();
myTools mt = new myTools();
sum = mt.sum(n);
System.out.println("斐波那契数中第n个数的值是" + sum);
}
}
class myTools{
public int sum(int n){
if(n > 2){
return sum(n - 1) + sum(n - 2);
}
else{
return 1;
}
}
}