斐波那契数列Python

def febo(n):
    if n > 2:
        value = febo(n-1) + febo(n-2)
        return value
    if n <= 2:
        return 1


def feibo(n):
    value = 1
    value2 = 1
    if n == 1:
        return 1
    if n == 2:
        return 1
    if n >= 2:
        for i in range(n-2):
            value3 = value2
            value2 = value
            value = value + value3
        return value


if __name__ == '__main__':
    print(febo(20))
    print(feibo(20))

递归，循环两种思路。因为面试现场没写出来，记录一下，别再让我碰见你！