裴波那契数列（javascript实现）

递归方式实现

function fibonacci (num) {
    if (num === 1 || num === 2) {
        return 1;
    }
    return fibonacci(num - 1) + fibonacci(num - 2);
}
复制代码

非递归方式实现

function fibonacci (num) {
    var n1 = 1,
        n2 = 1,
        n = 1;
    for (var i = 3; i <= num; i++) {
        n = n1 + n2;
        n1 = n2;
        n2 = n;
    }
    return n ;
}
复制代码

转载于:https://juejin.im/post/5b9e8621e51d450e74289a5b