11/16 2xn 타일링

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

.

내 풀이

def solution(n):
    tiles = [0 for _ in range(n)]
    tiles[0], tiles[1] = 1, 2
    for i in range(2, n) :
        tiles[i] = (tiles[i - 2] + tiles[i - 1]) % 1000000007
    return tiles[-1]