# 递归 def myadd(a, b): c = a + b print(c) if c > 100: return return myadd(a + 1, c) #最大递归深度是1000 myadd(2, 3) # 功能同上递归 a = 2 b = 3 for i in range(1000): c = a + b print(c) a += 1 b = c def myfibo(a, b): c = a + b print(c) if c > 500: return return myfibo(b, c) myfibo(0, 1) a = 0 b = 1 for i in range(1000): c = a + b print(c) a = b b = c if c > 500: break
如对本文有疑问, 点击进行留言回复!!
网友评论