递归函数
递归函数
递归的定义——在一个函数里再调用这个函数本身。
递归的最大深度是997,这是python从内存的角度出发给的安全限制,如果递归的次数太多,就不适合用递归来实现
递归的的缺点:占内存 递归的有点: 让代码变得简单
# n = 0 # def story(): # global n # n += 1 # print(n) # story() # story()
# alex 多大 n = 1 age(1) = age(2)+2 = age(n+1) + 2 # alex比egon大两岁 # egon多大? n = 2 age(2) = age(3) + 2 = age(n+1) +2 # egon比wusir大两岁 # wusir多大 n = 3 age(3) = age(4) + 2 = age(n+1) +2 # wusir比金老板大两岁 # 金老板多大? # 金老板40了 n = 4 age(4) = 40 def age(n): if n == 4: return 40 elif n >0 and n < 4: return age(n+1) + 2 print(age(1)) #1. def age(1): 14 #age(1) = age(2)+2 #age(1) = 44+2 # if 1 == 4: # return 40 # elif 1 >0 and 1 < 4: # 2. return age(1+1) + 2 13.#age(2)+2 # #3. def age(2): 12.#age(2) = age(3)+2 #age(2) = 42+2 # if 2 == 4: # return 40 # elif 2 >0 and 2 < 4: # 4. return age(2+1) + 2 11. #age(3)+2 # #5. def age(3): 10.#age(3) = age(4)+2 #age(3) = 40+2 # if 3 == 4: # return 40 # elif 3 >0 and 3 < 4: # 6. return age(3+1) + 2 9.#age(4)+2 =42 # #7. def age(4): #agw(4) = 40 # if 4 == 4: # 8. return 40 # elif 2 >0 and 2 < 4: # return age(2+1) + 2 print(age(1))