斐波那契数列的迭代实现
def fab(n):
n1 = 1
n2 = 1
n3 = 1
n1 = 1
n2 = 1
n3 = 1
if n < 1:
print("Erro!")
return -1
print("Erro!")
return -1
while(n-2)>0:
n3 = n2 + n1
n1 = n2
n2 = n3
n-=1
return n3
n3 = n2 + n1
n1 = n2
n2 = n3
n-=1
return n3
result = fab(20)
if result != -1:
print('The number of rabbits is' )
print(result)
if result != -1:
print('The number of rabbits is' )
print(result)
汉诺塔
def hand(n,x,y,z):
if n==1:
print(x,'-->',z)
else:
hand(n-1,x,z,y)
#将n-1个盘子从x移到y上
print(x,'-->',z)
#将最底下的最后一个盘子从X移到z上
hand(n-1,y,x,z)
#将y上的n-1个盘子移到z上
print(x,'-->',z)
else:
hand(n-1,x,z,y)
#将n-1个盘子从x移到y上
print(x,'-->',z)
#将最底下的最后一个盘子从X移到z上
hand(n-1,y,x,z)
#将y上的n-1个盘子移到z上
n = int(input('input the number:'))
hand(n,'X','Y','Z')
hand(n,'X','Y','Z')
斐波那契数列的递归实现
def fab(n):
if n<1:
print("Erro!")
return -1
if n==1 or n==2:
return 1
else:
return fab(n-1)+fab(n-2)
print("Erro!")
return -1
if n==1 or n==2:
return 1
else:
return fab(n-1)+fab(n-2)
result = fab(20)
if result!=-1:
print('The number of rabbits is')
print(result)
if result!=-1:
print('The number of rabbits is')
print(result)