python函数1

不用递归

a = 1
b = 1
for i in range(10):
#a,b = b,a+b
result = a + b
a = b
b = result
print(result)

递归求斐波那契数列

def fib(n):
if n <= 2:
return 1
return fib(n-1) + fib(n-2) # f(4) = f(3)+f(2)

for i in range(1,11):
print(fib(i))