剑指offer_斐波那契数列

题目链接：www.acwing.com/problem/con…

分析

Code

/**
 * @param {number} n
 * @return {number}
 */
var Fibonacci = function(n)
{
    let ans = [];
    ans[0] = 0;
    ans[1] = 1
    for(let i = 2; i <= 39; i ++){
        ans[i] = ans[i-1] + ans[i-2];
    }
    
    return ans[n];
    
}