题解 | #斐波那契数列#

package 剑指offer;

public class J27斐波那契数列 {
public static void main(String[] args) {
System.out.println(Fibonacci(4));
}

public static int Fibonacci(int n) {
    // 递推
    int f1 = 0;
    int f2 = 1;
    if (n == 0) return 0;
    if (n == 1) return 1;
    int fn = 0;
    for (int i = 1; i < n; i++) {
        fn = f1 + f2;
        f1 = f2;
        f2 = fn;
    }
    return fn;
}

}