通过两种方法求阶乘更好的理解递归含义。
递归必须有返回终止值。
1、非递归
def factorial(n):
result = n
for i in range(1,n):
result *= i
return result
number = int(input("请输入一个整数:"))
result = factorial(number)
print("%d的阶乘是%d" %(n,result))
#输入5,输出120
2、递归
def factorial(n):
if n == 1:
return 1
else:
return n*factorial(n-1)
number = int(input("请输入一个整数:"))
result = factorial(number)
print("%d的阶乘是%d" %(n,result))
#输入5,输出120
3、汉诺塔
def han(n,x,y,z):
if n == 1:
print(x,"---->",z)
else:
han(n-1,x,z,y)
print(x,"---->",z)
han(n-1,y,x,z)
n = int(input("请输入汉诺塔层数:"))
han(n,"x","y","z")