斐波那契数列的有趣解法

常见

def mod1(n):
    if n==1 or n==0:
        return 1
    elif n==2:
        return 2
    elif n>2:
        return mod1(n-1)+mod1(n-2)

def mod2(n):
    fibs=[1,1]
    if n==0|n==1:
        return 1
    else :
        for i in range(n-1):
            fibs.append(fibs[-2]+fibs[-1])
    return fibs

有趣的

def jieCheng(n):
    mul = 1
    for j in range(1, n+1):
        mul = mul*j
    return mul

while 1:
    n = (input("请输入位数: 按q退出", ))
    if n == 'q':
        exit()
    try:
        n = int(n)
    except ValueError:
        print("请输入数字类型")
        continue

    q = n // 2
    r = n % 2
    result = 0
    if r == 1:
        for i in range(1, q+1):
            numberForOne = n - i * 2
            result += jieCheng(i + numberForOne) // jieCheng(i) // jieCheng(numberForOne)
        result += 1
    else:
        for i in range(1, q):
            numberForOne = n - i * 2
            result += jieCheng(i + numberForOne) // jieCheng(i) // jieCheng(numberForOne)
        result += 2
    print(result)