剑指 Offer 10- I. 斐波那契数列 发表于 2022-04-24 123456789101112131415class Solution { public int fib(int n) { int a = 0, b = 1; while (n > 0) { int c = (a + b) % 1000000007; a = b; b = c; n--; } return a; }} 注意不要忘记取模。 Reference剑指 Offer 10- I. 斐波那契数列