[프로그래머스] 등굣길 (dp,파이썬)

못지나가는 길 puddles의 i,j가 바뀌어있음을 주의 

def solution(m, n, puddles):
    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==j==1: continue
            if [j,i] not in puddles:
                dp[i][j]=(dp[i-1][j]+dp[i][j-1])%1000000007
            
    return dp[n][m]