1、递归函数

#递归函数
#：自己调用自己

# def func1():
#     print(666)
#     func1()
# func1()
# import sys
# sys.setrecursionlimit(100000)

# 默认最大递归深度 998
# count = 0
# def func1(n):
#     n += 1
#     print(n)
#     func1(n)
# func1(count)

 

'''
n = 1  太白   age(1) = 23
n = 2  日天   age(2) = age(1) + 2
n = 3  wusir  age(3) = age(2) + 2
n = 4  alex  age(4) = age(3) + 2

'''

# def age(n):
#     if n == 1:
#         return 23
#     else:
#         return age(n-1) + 2
#
# print(age(4)) # 23 + 2 + 2 + 2

 

def age(4):
    if n == 1:
        return 23
    else:
        return age(n-1) + 2        age(4) =  age(3) + 2

ret = age(4)

def age(3):
    if n == 1:
        return 23
    else:
        return age(n-1) + 2        age(3) = age(2) + 2
        
def age(2):
    if n == 1:
        return 23
    else:
        return age(1) + 2          age(2) = age(1) + 2

def age(1):
    if n == 1:
        return 23                   age(1) = 23
    else:
        return age(1) + 2