(Python) 프로그래머스 - 2 x n 타일링
in Algorithm on Programmers, Level3
[문제 링크]
풀이
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]) % 1_000_000_007
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]) % 1_000_000_007
return dp[n]
