剑指Offer 10- I. 斐波那契数列（js版本）

斐波那契数列（js版本）

/**
 * @param {number} n
 * @return {number}
 */

// 字节要求 logn，去你的，矩阵快速幂
// https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof/solution/fei-bo-na-qi-shu-lie-by-leetcode-solutio-hbss/

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;
}



// O(n) 的写法：滚动数组，这个一定要掌握
var fib = function (n) {
    let mod = 1000000007;
    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;
}



// 自己写的，当然时间复杂度比较高
var fib = function (n) {
    let F = [];
    F[0] = 0, F[1] = 1;
    for (let i = 2; i <= n; i++) {
        F[i] = (F[i - 1] + F[i - 2]) % 1000000007;
    }
    return F[n];

};