递归浅析

递归:

1.函数调用本身

2.要有明确的结束标志

例:求1到指定数字的和(100)

sum(100) = sum(99) + 100

sum(99) = sum(98) + 99

......

sum(2) = sum(1) + 2

sum(1) = 1

def sum(num):
    # 设置结束标志
    if num == 1:
        return 1
    return sum(num-1) + num

递归嵌套最多1000层(python中)

  

原文地址:https://www.cnblogs.com/kongweisi/p/10539676.html