프로그래머스 - LV3. 등굣길

문제

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

프로그래머스

 

코드

def solution(m, n, puddles):
    gp = [[0] * (m+1) for _ in range(n+1)]
    gp[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:
                gp[i][j] = 0
            else:
                gp[i][j] = gp[i-1][j] + gp[i][j-1]
                
    return gp[n][m] % 1000000007