递归-python-斐波那契数列-循环

递归！

'''递归'''

list = []
def feiqinabo(n):
    if n <= 1:
        return n;
    if n > 1:
        return feiqinabo(n - 1) + feiqinabo(n - 2)

n = int(input("please input you want number:"))

for i in range(1, n + 1):
    print(feiqinabo(i))
    list.append(feiqinabo(i))

print("%s"%(list))

循环！

'''循环 '''
def fbXH(n):
    newList = [0, 1]
    for i in range(n -2):
        newList.append(newList[-2] + newList[-1])
    return newList

def main():
    result = fbXH(10)
    for i, num in enumerate(result):
        print("第%d个数是：%d"%(i, num))

if __name__ == "__main__":
    main()