阶乘的计算-递归思想

#阶乘的计算
#什么叫阶乘: 7 #7*6*5*4*3*2*1

1) 用递归函数实现阶乘的计算

def jiecheng(n):
    if n == 1:
        return 1
    return n*jiecheng(n-1)
result = jiecheng(3)
print(result)

步骤分解:

# 分解:
# def jiecheng(3):
#     if 3 == 1:
#         return 1
#     return 3*jiecheng(2)
#
# def jiecheng(2):
#     if 2 == 1:
#         return 1
#     return 2*jiecheng(1)
#
# def jiecheng(1):
#     if 1 == 1:
#         return 1
#     return n*jiecheng(n-1)

递归详解:

递归详解


2)用函数、循环实现阶乘的计算

def jiecheng(n):
    result = n
    for i in range(1, n):
        result = result * i
    return result

print(jiecheng(4))
原文地址:https://www.cnblogs.com/bigtreei/p/7806069.html