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