https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof/
dp优化:
func fib(n int) int {
if n == 0 {
return 0
}
if n == 1 {
return 1
}
per, cur := 0, 1
for i := 2; i <= n; i++ {
tmp := (per + cur) % 1000_000_007
per = cur
cur = tmp
}
return cur
}