class Solution {
public:
int fib(int n) {
Fn[0] = 0;
Fn[1] = 1;
for (int i = 2; i <= n; i++) {
Fn[i] = (Fn[i - 1] + Fn[i - 2]) % 1000000007;
}
return Fn[n];
}
private:
int Fn[101];
};
剑指 Offer 10- I. 斐波那契数列
最新推荐文章于 2024-07-13 13:36:16 发布