python打印斐波那契数列

#递归
def fibo(n):
    if n <= 1:
        return n
    else:
        return (fibo(n - 1) + fibo(n - 2))

m = int(input("打印前多少项?"))
if m <= 0:
    print("请输入正整数！")
else:
    print("fibo:")
    for i in range(m):
        print(fibo(i))

继续研究下如何缩短时间  如果n太大的话时间太长

https://blog.csdn.net/swliao/article/details/5337896

#迭代
def fibo(n):
    s = 1
    for i in range(n):
        s+=i
    return s

m = input("打印前多少项？")
print("fibo")
for i in range(m):
    print fibo(i)