[프로그래머스] 등굣길

😎코딩테스트 연습>동적계획법(Dynamic Programming)>등굣길

📘 문제풀이

def solution(m, n, puddles):
    answer = 0
    dp = [[0] * (m+1) for _ in range(n+1)]
    dp[1][1] = 1
    
    for i in range(1, n+1):
        for j in range(1, m+1):
            if i == 1 and j == 1:
                continue
            if [j, i] in puddles:
                dp[i][j] = 0
            else:
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
    
    
    return dp[n][m] % 1000000007