python 递归\for循环_斐波那契数列

# 递归
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