[Programmers] Lv 2. 2 x N 타일링

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

프로그래머스

 

#include <string>
#include <vector>

using namespace std;

int solution(int n) {
    vector<int> dp(n + 1, 1);

    for (int i = 2; i <= n; ++i)
        dp[i] = (dp[i - 2] + dp[i - 1]) % 1000000007;

    return dp[n];
}

GitHub :https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/806b0ffb2359846cc53c2d05d94cd0bc50e3684e 

[level 2] Title: 2 x n 타일링, Time: 0.29 ms, Memory: 3.79 MB -BaekjoonHub · developeSHG/Algorithm-Baekjoon_Programmers@806b