题目描述
大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。n<=39
class Solution {
public:
int Fibonacci(int n) {
if(n <= 0)
return 0;
if(n == 1)
return 1;
int fn_1 = 1;
int fn_2 = 0;
int fn = 0;
for(int i = 2; i <= n; ++i)
{
fn = fn_1 + fn_2;
fn_2 = fn_1;
fn_1 = fn;
}
return fn;
}
};