斐波那契数列以如下被以递推的方法定义:
F ( n ) = { n n < 2 F ( n − 1 ) + F ( n − 1 ) n > 2 F(n)=\left\{\begin{array}{cc} n & n<2 \\ F(n-1)+F(n-1) & n>2 \end{array}\right. F(n)={nF(n−1)+F(n−1)n<2n>2
第一种(递归):
def Fibo(n):
if n < 2:
return n
else:
return Fibo(n-1) + Fibo(n-2)
if __name__ == "__main__":
n = input("请输入:")
result = Fibo(n)
print(result)
第二种:
def Fibo(n):
if n < 2:
return n
else:
a,b = 0,1
for i in range(2,n+1):
a,b = b,a+b
return b
if __name__ == "__main__":
n = int(input("请输入:"))
result = Fibo(n)
print(result)