[프로그래머스] 2 x n 타일 파이썬 (DP)

 

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

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

출처: it-garden.tistory.com/410