题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
public class Solution {
public int Fibonacci(int n) {
if (n == 1 || n == 2) {
return 1;
}
int a = 1, b = 1, c = 1;
for (int i = 3; i <= n; i++) {
c = a + b;
a = b;
b = c;
}
return c;
}
}
另外宣传下自己的开源仿b站微服务项目，GitHub已经390star，牛客上有完整文档教程，如果觉得有帮助的话可以点个小星星，蟹蟹