def fib(n):
L=[]
a,b=1,1
while len(L)<n:
L.append(a)
a,b=b,a+b
print L
print L[-1]
if __name__=='__main__':
fib(10)
def fib(n):
a, b = 0, 1
while a < n:
print a,
a, b = b, a+b
if __name__=='__main__':
fib(10)
输出斐波那契数列第n项和前n项
最新推荐文章于 2024-09-09 21:31:59 发布