1. 用非递归实现5的阶乘
def unrecursion(n): result = n for i in range (1,n): result *= 1 return result number = int(input("please input a int type number")) result = unrecursion(number) print("%d的阶乘是:%d"%(number,result))
2. 递归实现
def recursion(n): if n == 1: return 1 else: return n*recursion(n-1) number = int(input("please input a int type number")) result = recursion(number) print("%d的阶乘是:%d"%(number,result))