动态规划, 效率比递归高,也容易理解
function fibonacci(n) { const dp = new Array(n+1) dp[1] = 1 dp[2] = 1 for(let i=3;i<=n;i++){ dp[i] = dp[i-1] + dp[i-2] } return dp[n] }