등굣길 -python (programmers)

DFS/BFS level3

등굣길

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

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