백준 2178번 미로 탐색 [ Java ]

2178번: 미로 탐색

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        int[] dx = new int[]{1, 0, -1, 0};
        int[] dy = new int[]{0, 1, 0, -1};
        int n = Integer.parseInt(st.nextToken());
        int m = Integer.parseInt(st.nextToken());
        int[][] field = new int[n][m];
        int[][] dist = new int[n][m];
        for (int i=0; i<n; i++)
            field[i] = Arrays.stream(br.readLine().split("")).mapToInt(Integer::parseInt).toArray();
        ArrayList<int[]> Q = new ArrayList<>();
        Q.add(new int[]{0, 0});
        dist[0][0] = 1;
        while (!Q.isEmpty()){
            int[] cur = Q.remove(0);
            for (int dir = 0; dir<4; dir++){
                int nx = cur[1] + dx[dir];
                int ny = cur[0] + dy[dir];
                if (nx < 0 || nx>=m || ny<0 || ny>=n) continue;
                if (dist[ny][nx] > 0 || field[ny][nx] != 1) continue;
                dist[ny][nx] = dist[cur[0]][cur[1]]+1;
                Q.add(new int[]{ny, nx});
            }
        }
        System.out.print(dist[n-1][m-1]);
    }
}