-----------------------------------------------------------------------------
题目:斐波那契数列。
程序分析:斐波那、5、8、13、21、34、……。
"""
#!/usr/bin/python
# -*- coding: UTF-8 -*-
l = []
def fib(n):
a = 1
b = 1
for i in range(n-1):
a, b = b, a + b
l.extend([a,b])
return (a)
print("The 2result1 is:",fib(10))
print('The 2result2 is:',l)
'''
l = []
for i in range(7):
x = input('integer:\n')
l.append(x)
l.sort()
print('The result is:',l)
print(l)
'''
-----------------------------------------------------------------------------
题目:斐波那契数列。
程序分析:斐波那、5、8、13、21、34、……。
"""
#!/usr/bin/python
# -*- coding: UTF-8 -*-
def fib(n):
if n == 1:
return [1]
if n == 2:
return [1,1]
fibs = [1,1]
for i in range(2 , n):
fibs.append(fibs[-1] + fibs[-2])
return (fibs)
print("The right result is:",fib(50))