大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。
class Solution {
public:
int Fibonacci(int n) {
/* if(n <= 0) return 0;
if(n <= 1) return 1;
return Fibonacci(n-1)+Fibonacci(n-2);
*/
if(n <= 0) return 0;
if(n <= 1) return 1;
int fib_one = 1;
int fib_two = 0;
int fib_num = 1;
for(int i = 2; i <= n; ++i)
{
fib_num=fib_one+fib_two;
fib_two=fib_one;
fib_one=fib_num;
}
return fib_num;
}
};