C语言训练-斐波纳契数列-题解(C++代码)

递归数组求解

#include<iostream>
using namespace std;
int main()
{
    int n_int; cin >> n_int;
    int arr_int[40];
    arr_int[0] = arr_int[1] = 1;
    for (int i_for1_int = 2; i_for1_int < n_int; i_for1_int++)
        arr_int[i_for1_int] = arr_int[i_for1_int - 1] + arr_int[i_for1_int - 2];
    for (int i_for1_int = 0; i_for1_int < n_int; i_for1_int++)
        cout << arr_int[i_for1_int] << " ";
}