题解 | #斐波那契数列#
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
class Solution {
public:
int Fibonacci(int n) {
int fibo[40];
fibo[0] = 1;
fibo[1] = 1;
int i = 2;
while(i<=n)
{
fibo[i] = fibo[i-1] + fibo[i-2];
i++;
}
return fibo[n-1];
}
};
哇塞，牛客的IO真的太神奇了。。。。
查看5道真题和解析