class Solution {
public:
int fib(int n) {
if (n == 0) return 0;
if (n == 1) return 1;
if (n == 2) return 1;
int dp[2] = {1, 1};
int tmp;
for (int i = 3; i <= n; ++i) {
tmp = dp[1];
dp[1] = (dp[1] + dp[0]) % (int)(1e9 + 7);
dp[0] = tmp;
}
return dp[1];
}
};
剑指 Offer 10- I. 斐波那契数列
最新推荐文章于 2024-10-16 00:00:43 发布