描述:
大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。
n<=39
思路:
1. 确定前两项a, b = 0, 1
2. 如果n > 1,a, b = b, a + b,相当于每次求出数列的最后两个数字
python代码:
class Solution:
def Fibonacci(self, n):
# write code here
a, b = 0, 1
if n == 0:
return a
elif n == 1:
return b
else:
count = 1
while count < n:
a, b = b, a + b
count += 1
return b
C++代码:
class Solution {
public:
int Fibonacci(int n) {
int a;
int b;
int swap;
a = 0;
b = 1;
if(n < 2)
{
return n;
}
for(int count = 1; count < n; count = count + 1)
{
swap = a;
a = b;
b = swap + a;
}
return b;
}
};