2 X n 타일링 C++

https://programmers.co.kr/learn/courses/30/lessons/12900

코딩테스트 연습 - 2 x n 타일링

#include <string>
#include <vector>

using namespace std;

int solution(int n) {
    int answer = 0;
    int way[60002];
    
    way[0] = 0;
    way[1] = 1;
    way[2] = 2;
    
    for(int i=3; i<=n; i++){
        way[i] = (way[i-1] + way[i-2])%1000000007;
    }
    
    answer = way[n];
    return answer;
}