斐波那契三种递归方式实现

/**
 * 斐波那契函数的递归实现
 *
 * 1 1 2 3 5 8 13 21
 */
public class FibonacciTest {

    private int []data;

    public FibonacciTest(int n) {
        data = new int[n];
    }

    public static void main(String[] args) {
        FibonacciTest fib = new FibonacciTest(100);
        long startTime = System.currentTimeMillis();
        System.out.println(fib.fibonacci_1(30));
        long endTime = System.currentTimeMillis();
        System.out.println("fibonacci_1 cost " + (endTime - startTime) + "ms");
        System.out.println(fib.fibonacci_2(30));
        long endTime1 = System.currentTimeMillis();
        System.out.println("fibonacci_2 cost " + (endTime1 - endTime) + "ms");
        System.out.println(fib.fibonacci_3(1,1,30));
        long endTime2 = System.currentTimeMillis();
        System.out.println("fibonacci_3 cost " + (endTime2 - endTime1) + "ms");
    }

    /**
     * 递归函数，时间复杂度O(n^2)
     * @param n
     * @return
     */
    public int fibonacci_1(int n) {
        if (n <= 2) {
            return 1;
        }
        return fibonacci_1(n-1) + fibonacci_1(n-2);
    }

    /**
     * 采用缓存进行递归 时间复杂度O(n)
     * @param n
     * @return
     */
    public int fibonacci_2(int n) {
        if (n <= 2) {
            return 1;
        }
        int num = data[n];
        if (num > 0)
            return num;
        int res =  fibonacci_2(n-1) + fibonacci_2(n-2);
        data[n] = res;
        return res;
    }

    /**
     * 采用尾递归 时间复杂度O(n)
     * n的长度需要大于2
     * 计算是从前往后累加
     * @param n
     * @return
     */
    public int fibonacci_3(int pre, int pre_next, int n) {
        if (n <= 2) {
            return pre;
        }
        int new_pre_next = pre;
        int new_pre = pre_next +pre;
        return fibonacci_3(new_pre, new_pre_next, n-1);
    }

}