题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/aa8ffe28ec7c4050b2aa8bc9d26710e9
动态规划， 效率比递归高，也容易理解
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]
}
