斐波那契数列的多种解法

f(0) = 0 f(1) = 1 f(n) = f(n-1) + f(n-2)

1. 递归法

var fib = function (n) {
    var res;
    if (n == 0) return 0;
    if (n == 1) return 1;
    if (n >= 2) {
        res = (fib(n - 1) + fib(n - 2)) % (1e9 + 7);
    }
    return res;
};

2. for循环

var fib = function (n) {
    var fibon = [0, 1];
    if (n >= 2) {
        for (let i = 2; i <= n; i++) {
            fibon[i] = (fibon[i - 1] + fibon[i - 2]) % (1e9 + 7);
        }
    }
    return fibon[n]
};

3. 动态规划

var fib = function (n) {
    const MOD = 1e9 + 7
    if (n < 2) return n;
    let p = 0, q = 0, r = 1;
    for (let i = 2; i <= n; i++) {
        p = q;
        q = r;
        r = (p + q) % MOD;
    }
    return r;
};

4. 矩阵快速幂

var fib = function (n) {
    if (n < 2) return n;
    const q = [[1, 1], [1, 0]];
    const res = pow(q, n - 1);
    return res[0][0];
}

const pow = (a, n) => {
    let ret = [[1, 0], [0, 1]];
    while (n > 0) {
        if ((n & 1) === 1) {
            ret = multiply(ret, a);
        }
        n >>= 1;
        a = multiply(a, a);
    }
    return ret;
}

const multiply = (a, b) => {
    const c = new Array(2).fill(0).map(() => new Array(2).fill(0));
    for (let i = 0; i < 2; i++) {
        for (let j = 0; j < 2; j++) {
            c[i][j] = (BigInt(a[i][0]) * BigInt(b[0][j]) + BigInt(a[i][1]) * BigInt(b[1][j])) % BigInt(1000000007);
        }
    }
    return c;
}