https://blog.csdn.net/needforskillzh-cnhttps://blog.csdn.net/https://blog.csdn.net/needforskill/article/details/5648323https://blog.csdn.net/needforskill/article/details/5648323needforskillFri, 04 Jun 2010 19:41:00 +0800以前面试遇到关于菲波那契数列的算法问题
有一次是要求使用递归算法实现，语言不限
当时随便写了个：
 
public class Test { private static int size = 20; private int sum; public int foo(int i){ if(i>0) if(i==1||i==2) sum = 1; else sum = foo(i-1)+foo(i-2); ]]>