递归求斐波那契数列

def get(s):
    arr = []
    def fun(n):
        if n<2:
            return 1
        else:
            return fun(n-1) + fun(n-2)
    for i in range(0,s):
        arr.append(fun(i))
    return arr


num=int(input("请输入数字："))
result=get(num)
print (result)