C++ 斐波那契 非递归写法

#include 
#include 

using namespace std;

int Fibonacci(int num)
{
    if(num <= 2)
    {
        return 1;
    }
    else
    {
        vector<int> FibNums(num);
        FibNums[0] = 1;
        FibNums[1] = 1;

        for(int i = 2; i< num; ++i)
        {
            FibNums[i] = FibNums[i - 1] + FibNums[i - 2];
        }

        return FibNums[num - 1];
    }
}

int main()
{
    cout << Fibonacci(5);
    return 0;;
}