[Programmers] Lv2: 2 x n 타일링(12900)

문제

- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12900?language=java

 

풀이

class Solution {
    public int solution(int n) {
        int answer = 0;
        long[] tile = new long[n + 1];
        tile[0] = 0;
        tile[1] = 1;
        tile[2] = 2;
        for (int i = 3; i < n + 1; ++i) {
            tile[i] = (tile[i - 1] + tile[i - 2]) % 1_000_000_007;
        }
        
        answer = (int)tile[n];
        return answer;
    }
}