比如 1,1,2,3,5,8,13,21,34,55,.............
------解决方案--------------------
public class Fibonacci {
public static int fun(int n)
{
if(n==0)
{
return 0;
}
else if(n==1)
{
return 1;
}
else
{
return fun(n-1)+fun(n-2);
}
}
public static void main(String[] args)
{
int n=12;
for(int i=1;i <n;i++)
{
System.out.print(fun(i)+ " ");
}
}
}