非递归斐波那契

#include<iostream>
#include<assert.h>
using namespace std;

void fibnacci(int n)
{
    assert(n>0);
    int n1=1,n2=1,num;
    for(int i=0;i<n;++i){
        if(i==0||i==1){
            cout << 1 << " ";
        }else{
            num = n1+n2;
            n2 = n1;
            n1 = num;
            cout << num << " ";
        }
    }
    cout << endl;
}

int main()
{
    fibnacci(10);
}

1 1 2 3 5 8 13 21 34 55