dis 배열 없이 풀어봤습니다

import java.io.*;
import java.util.*;

class Point {
    int x;
    int y;
    Point(int x, int y) {
        this.x = x;
        this.y = y;
    }
}

public class Main {
    static int[] dx = {-1, 0, 1, 0};
    static int[] dy = {0, -1, 0, 1};
    static int[][] board = new int[8][8];
    public static void BFS(int x, int y) {
        int L = 0;
        Queue<Point> Q = new LinkedList<>();
        Q.offer(new Point(x,y));
        while(!Q.isEmpty()) {
            int len = Q.size();
            for(int i=0; i<len; i++) {
                Point tmp = Q.poll();
                for(int j=0; j<4; j++) {
                    int nx = tmp.x + dx[j];
                    int ny = tmp.y + dy[j];
                    if (nx >= 1 && nx <= 7 && ny >= 1 && ny <= 7 && board[nx][ny] == 0) {
                        board[nx][ny] = L+1;
                        Q.offer(new Point(nx, ny));
                    }
                }
            }
            L++;
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        for(int i=1; i<=7; i++) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            for(int j=1; j<=7; j++) {
                board[i][j] = Integer.parseInt(st.nextToken());
            }
        }
        BFS(1,1);
        if(board[7][7] == 0) System.out.println(-1);
        else System.out.println(board[7][7]);

    }
}

dis 배열없이 레벨과 board 배열만으로 풀었는데, 채점 결과 맞긴했는데 이렇게 짜도 될까요?