sainnhe
/
leetcode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
leetcode/notes/src/dynamic-programming-basic.md

239 B
Raw Blame History

基础问题

509. 斐波那契数

  1. dp[i] 是第 i 个斐波那契数的数值
  2. dp[i] = dp[i - 1] + dp[i - 2]
  3. dp[0] = 0, dp[1] = 1
  4. 从前向后遍历