//递归会超时,使用滚动数组的思想。
class Solution {
public:
int fib(int n) {
if (n == 0 || n == 1) return n;
int p = 0, q = 0, r = 1;
for (int i = 1; i < n; i ++)
{
p = q;
q = r;
r = p + q;
r %= 1000000007;
}
return r;
}
};
剑指offer:斐波那契数列
于 2022-01-19 15:06:06 首次发布