java实现斐波那数的两种方法

public class Fibona {
    public static void main(String[] args) {
        int result = function1(20);
        System.out.println(result);
    }

    private static int function1(int number) {
        if (number <= 1) {
            return number;
        }

        return function1(number - 1) + function1(number - 2);
    }

    private static int function2(int number) {
        if (number <= 0) {
            return 0;
        }
        if (number == 1) {
            return 1;
        }

        int first = 0;
        int second = 1;
        for (int i = 0; i < number - 1; i++) {
            int sum = first + second;
            first = second;
            second = sum;
        }

        return second;

    }
}