230603 2 x n 타일링

public static int solution(int n) {
    final int MOD = 1000000007;
    long[] dp = new long[n + 1];
    dp[1] = 1;
    dp[2] = 2;
    for (int i = 3; i <= n; i++) {
        dp[i] = dp[i - 1] % MOD + dp[i - 2] % MOD;
    }
    return (int) dp[n];
}

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