classSolution{publicintfib(int n){if(n <=1)return n;int a =0, b =1, c =0;for(int i =2; i <= n; i++){
c =(a + b)%1000000007;
a = b;
b = c;}return c %1000000007;}}
题目描述题目连接:剑指 Offer 10- I. 斐波那契数列题解:动态规划思想初值:f0 = 0, f1 = 1递推公式:f (n) = f (n - 1) + f (n - 2)由于f (n)只和前两个有关,所以可以利用三个变量来进行空间优化class Solution { public int fib(int n) { if (n <= 1) return n; int a = 0, b = 1, c = 0; for