C++ 斐波那契数列

递归

 

#include <iostream>

using namespace std;

int fib(int num) {
    if(num == 0)
        return 0;
    if(num == 1)
        return 1;
    return fib(num - 2) + fib(num - 1);
}

int main() {
    for(int i = 0; i < 10; i++)
    {
        cout << fib(i) <<" ";
    }
    cout << endl;
    
    return 0;
}

 

循环

 

#include <iostream>

using namespace std;

void fib();

int main() {
    fib();
    return 0;
}

void fib()
{
    int num1 = 0, num2 = 1;
    cout<< num1 << " " << num2 <<" ";
    
    for(int i = 0; i < 10; i++)
    {
        cout << num1 + num2 << " ";

        int num2temp = num2;
        num2 = num1 + num2;
        num1 = num2temp;
    }
}

 

转载于:https://www.cnblogs.com/KresnikShi/p/10747440.html