应用的是递归的思想
public class Fbo {
public static void main(String[] args) {
int nums = fibonacci(4);
System.out.println(nums);
}
static int fibonacci(int n){
if(n<=1) return 1;
return fibonacci(n-1)+fibonacci(n-2);
}
}
转载于:https://blog.51cto.com/jeiofw/964673