递归-Python

#!/usr/bin/env python
# -*- encoding: utf-8 -*-
‘‘‘
@File        :Fibonacci.py
@Description :Fibonacci: 1、1、2、3、5、8、13、21
@CreatTime   :2020/08/24 11:20:03
@Author      :Yunhgu
@Version     :1.0
‘‘‘
def Fibonacci(num):
    if num == 1 or num == 2:#第一、二个数都是1
        return 1
    else:
        return Fibonacci(num-1)+Fibonacci(num-2)

if __name__ == "__main__":
    for i in range(1,11):
        print(f‘Fibonacci第{i}个:{Fibonacci(i)}‘)