时间复杂度O(n),空间复杂度O(1)解斐波那契数列

#include <stdio.h>
#include <iostream>
using namespace std;
long long fibs1(int in_iN) {
    if(in_iN < ) {
        return -;
    }else if(in_iN == ) {
        return ;
    }else if(in_iN == ) {
        return ;
    }
    long long t_i1 = ;
    long long t_i2 = ;
    long long t_iValue = ;
    int t_k = ;
    while(t_k <= in_iN) {
        t_iValue = t_i1 + t_i2;
        t_i1 = t_i2;
        t_i2 = t_iValue;
        t_k ++;
    }
    return t_iValue;
}

long long fibs2(int in_iN) {
    if(in_iN < ) {
        return -;
    }else if(in_iN == ) {
        return ;
    }else if(in_iN == ) {
        return ;
    }else {
        return fibs2(in_iN - ) + fibs2(in_iN - );
    }
}
int main()
{
    int    in_iN = ;
    cout << fibs1(in_iN) << endl;
    cout << fibs2(in_iN) << endl;
    cin >> in_iN;
    return ;
}