C++ 显示斐波那契数列的程序-立地货

显示斐波那契数列的 C++ 程序

在本文中，您将学习在 C++ 编程中打印斐波那契数列(最多第 n 项，最多到某个数字)。

要理解此示例，您应该了解以下C++ 编程主题:

C++ for Loop

C++ while 和 do...while 循环

斐波那契数列是一个序列，其中下一项是前两项之和。斐波那契数列的前两项是 0 后跟 1、

The Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21

示例 1: 最多 n 个项的斐波那契数列

#include <iostream>
using namespace std;
int main() {
    int n, t1 = 0, t2 = 1, nextTerm = 0;
    cout << "Enter the number of terms: ";
    cin >> n;
    cout << "Fibonacci Series: ";
    for (int i = 1; i <= n; ++i) {
        // Prints the first two terms.
        if(i == 1) {
            cout << t1 << ", ";
            continue;
        }
        if(i == 2) {
            cout << t2 << ", ";
            continue;
        }
        nextTerm = t1 + t2;
        t1 = t2;
        t2 = nextTerm;
        
        cout << nextTerm << ", ";
    }
    return 0;
}

输出

Enter the number of terms: 10
Fibonacci Series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34,

示例 2: 生成特定数字的斐波那契数列的程序

#include <iostream>
using namespace std;
int main() {
    int t1 = 0, t2 = 1, nextTerm = 0, n;
    cout << "Enter a positive number: ";
    cin >> n;
    // displays the first two terms which is always 0 and 1
    cout << "Fibonacci Series: " << t1 << ", " << t2 << ", ";
    nextTerm = t1 + t2;
    while(nextTerm <= n) {
        cout << nextTerm << ", ";
        t1 = t2;
        t2 = nextTerm;
        nextTerm = t1 + t2;
    }
    return 0;
}

输出

Enter a positive integer: 100
Fibonacci Series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,