1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

// @Title: 斐波那契数列 (斐波那契数列  LCOF)
// @Author: 15816537946@163.com
// @Date: 2022-02-12 21:33:11
// @Runtime: 0 ms
// @Memory: 1.9 MB
func fib(n int) int {
    if n <2 {
        return n
    }
    const mod int = 1e9 + 7
    n1,n2 :=0,1
    for i:=2;i<=n;i++{
        n2,n1 = (n1+n2)%mod,n2
    }

    return n2

}