分别用递归和迭代解决Fibonacci数列
def f(n):n1 = 1
n2 = 1
if n <=2:
return 1
while n > 2 :
n3 = n1 + n2
n1 = n2
n2 = n3
n = n -1
return n3
temp = int(input('log in a number:'))
result = f(temp)
print('%d个月后有%d只兔子！'%(temp,result))
def f(n):
if n <=2:
return 1
else:
return f(n-2) + f(n-1)
temp = int(input('log in a number:'))
result = f(temp)
print('%d个月后有%d只兔子！'%(temp,result))
页:
[1]