python如何实现斐波那契数列

fibs = [1,2]
for i in range(8):
    fibs.append(fibs[-2] + fibs[-1])
print(fibs)

i = 0
j = 1
while i<10000
    print(i，end = ' ')
    i,j = j,i+j

def fibs(n):
    if n < 1:
        return -1
    elif n==1 or n==2:
        return 1
    else:
        return fibs(n-1) + fibs(n-2)
num = int(input('input num:'))
for i in range(1,num+1):
    print(fibs(i),end=' ')

0、1、1、2、3、5、8、13、21、34、……

F(1)=1
F(2)=1
F(n)=F(n - 1)+F(n - 2)（n ≥ 3，n ∈ N*）

def fib(n):
    list = [0,1]
    a,b = 0,1
    for i in range(2,n+1):
        a,b=b,a+b 
        list.append(b)
    return list
while True:
    try:
        x = int(input('请输入斐波那契数列的长度:'))
        if x <= 0:
            print('长度输入不合法!')
            continue
        else:
            sum = 0
            list = fib(x) # 调用前面写的fib函数
            print('前{}项的斐波那契数列是:'.format(x))
            for j in range(0,x):
                print(list[j],end=' ')
                sum = sum + list[j] # 求和
            print ('\n')
            print('前{}项的斐波那契数列之和是:\n{}'.format(x,sum))
            break
    except ValueError:
        print ('长度输入不合法!')
        continue