[SWEA][Python] 4875 미로 평범한 DFS 경로 탐색. def DFS(x,y): for i in range(4): nx = x+dx[i] ny = y+dy[i] if 0 practivceAlgorithm/swexpertacademy 2021.08.20