fib 2021-12-20 05:40
public int fib(int n) {
int mod = 1000000007;
if (n < 2) {
return n;
}
int first = 0;
int second = 0;
int result = 1;
for (int i = 2; i <= n; i++) {
first = second;
second = result;
result = (first + second) % mod;
}
return result;
}
| Runtime | Memory |
|---|---|
| 0 ms | 35.2 MB |
EOF