package com.fonxian;
public class Fibonacci {
static int findFibonacci(int n){
if(2==n||1==n)
return 1;
return findFibonacci(n-1)+findFibonacci(n-2);
}
public static void main(String[] args) {
for(int i = 1;i < 10;i++)
System.out.print(findFibonacci(i)+" ");
System.out.println();
}
}
测试结果
1 1 2 3 5 8 13 21 34