斐波那契数列:
时间复杂度:
空间复杂度:
这题和青蛙跳台阶-2初始值稍有不同,需要审题清楚,状态转移方程是一样的
class Solution {
public:
int fib(int n) {
if (n <= 1) return n;
int first = 0;
int second = 1;
int thrid;
for (int i = 2; i <= n; ++i) {
thrid = (first + second) % 1000000007;
first = second;
second = thrid;
}
return thrid;
}
};