java实现斐波那契数列

方法一(经典)

public class test {
    public static void main(String[] args) {
        for (int i = 1; i <= 50; i++) {
            System.out.println(f1(i));
        }
    }
    public static int f1(int n) {
        if(n < 1) {
            return 0;
        }else if(n == 1 || n == 2) {
            return 1;
        }
        return f1(n-1) + f1(n-2);
    }
}

方法2:(顺序求法):

public class test {
    public static void main(String[] args) {
        for (int i = 1; i <= 50; i++) {
            System.out.println(f2(i));
        }
    }
    public static int f2(int n) {
        if (n < 1) {
            return 0;
        } else if (n == 1 || n == 2) {
            return 1;
        }
        int res = 1;
        int pre = 1;
        int temp = 0;
        for (int i = 3; i < n; i++) {
            temp = res;
            res = pre + res;
            pre = temp;
        }
        return res;
    }
}