【算法】斐波那契数列，非递归

提交网站：
http://codeup.hustoj.com/problem.php?id=5740

#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long LL;

void Fibonacci(int n) {
    
    
    LL F_N_1 = 1, F_N_2 = 1;
    LL F_N = F_N_1+ F_N_2;
    for (int i = 0; i <  n; i++)
    {
    
    
        if (i <= 1)
        {
    
    
            cout << 1 << " ";
        }
        else {
    
    

            F_N = F_N_1 + F_N_2;
            F_N_2 = F_N_1;
            F_N_1 = F_N;
            cout << F_N << " ";
        }
    }
}
int main()
{
    
    
    int n;
    cin >> n;
    Fibonacci(n);
}