>>> import sys
>>> sys.setrecursionlimit(100)
def factorial(n):
result = n
for x in range(1,n):
result *= x
return result
number = int(input("请输入一个整数"))
result = factorial(number)
print("%d 阶乘是 %d" %(number,result))
input()
---------华丽的分割线----------
def factorial(n):
if n == 1:
return 1
else:
return n * factorial(n-1)
number = int(input("请输入一个正整数:"))
result = factorial(number)
print("%d 阶乘是:%d" %(number,result))
input()
递归每次操作会进行压栈、弹栈操作、恢复寄存器操作,
导致程序性能下降,注意使用在合理场景(树、汉诺塔)
-------------------------------------------
def fab(n):
n1 = 1
n2 = 1
n3 = 1
if n < 1 :
print("error")
return -1
while (n-2) > 0 :
n3 = n2 + n1
n1 = n2
n2 = n3
n -= 1
return n3
result = fab(20)
if result != -1:
print("total:%d" % result)
input()
def fab(n):
if n < 1:
print("error")
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("totoal:%d" % result)
input()
--------------------------------------
def hanoi(n,x,y,z):
if n == 1:
print(x, '-->', z)
else:
hanoi(n-1,x,z,y)
print(x, '-->',z)
hanoi(n-1,y,x,z)
n = int(input("请输入汉诺塔层数:"))
hanoi(n,'x','y','z')