링크import java.util.*;class Solution { public int nearestExit(char[][] maze, int[] entrance) { int result = -1; Queue queue = new LinkedList(); int m = maze.length; int n = maze[0].length; int[][] visited = new int[m][n]; for(int i = 0; i r.route + 1) { visited[r.x + 1][r.y] = r.route + 1; queue.add(new Route(r.route + 1,..