Python 程序查找斐波那契数列的总和

在本文中，我们将向您展示如何使用 for 循环、while 循环和递归函数编写一个 Python 程序来查找斐波那契数列的总和。在此示例中，我们使用 for 循环迭代从零到 n，并查找该范围内所有斐波那契数列的总和。

Number = int(input("Please Enter the Fibonacci Number Range = "))

First = 0
Second = 1
Sum = 0

for Num in range(0, Number):
    print(First, end = '  ')
    Sum = Sum + First
    Next = First + Second
    First = Second
    Second = Next

print("\nThe Sum of Fibonacci Series Numbers = %d" %Sum)

使用 while 循环查找斐波那契数列总和的程序

此 程序 使用 while 循环查找 斐波那契 数列的总和。请参考 For Loop 和 while Loop 文章。

Number = int(input("Please Enter the Range = "))

First = 0
Second = 1
Sum = 0
i = 0

while(i <  Number):
    print(First, end = '  ')
    Sum = Sum + First
    Next = First + Second
    First = Second
    Second = Next
    i = i + 1

print("\nThe Sum = %d" %Sum)

Please Enter the Range = 24
0  1  1  2  3  5  8  13  21  34  55  89  144  233  377  610  987  1597  2584  4181  6765  10946  17711  28657  
The Sum = 75024

使用递归查找斐波那契数列总和的 Python 程序

此 程序 使用递归或递归函数查找所有斐波那契数列的总和。

def fibonacci(Number):
    if(Number == 0):
        return 0
    elif Number == 1:
        return 1
    else:
        return fibonacci(Number - 2) + fibonacci(Number - 1)
    

Number = int(input("Please Enter the Range = "))
Sum = 0

for Num in range(Number):
    print(fibonacci(Num), end = '  ')
    Sum = Sum + fibonacci(Num)


print("\nThe Sum = %d" %Sum)

Please Enter the Range = 30
0  1  1  2  3  5  8  13  21  34  55  89  144  233  377  610  987  1597  2584  4181  6765  10946  17711  28657  46368  75025  121393  196418  317811  514229  
The Sum = 1346268