[lv2] 2 x n 타일링

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

 

dp 기본형

class Solution {
    public int solution(int n) {
        int answer = 0;
        int mod = 1000000007;

        int[][] dp = new int[n][2];

        dp[0][0] = 1;

        for(int i=1; i<n; i++) {
            if(i == 1) {
                dp[i][0] = 1;
                dp[i][1] = 1;
            }
            else {
                dp[i][0] = (dp[i-1][0] + dp[i-1][1]) % mod;
                dp[i][1] = (dp[i-2][0] + dp[i-2][1]) % mod;
            }
        }

        return (dp[n-1][0] + dp[n-1][1]) % mod;
    }
}