斐波那契数列

public class Fibonacci {
    public static int[] record = null;
    public int Fibonaci(int n){
        if(n<=1){
             return n;
        }
        if(null == record){
            record = new int[n+1];
        }
        if(0!=record[n-2] && 0!=record[n-1]){
            record[n] = record[n-2] + record[n-1];
        } else {
            return Fibonaci(n-2) + Fibonaci(n-1);
        }
        return Fibonaci(n);
    }
}