[백준1697 : 숨바꼭질] Java,BFS

package mnth_11;
import java.util.Scanner;
import java.util.Queue;
import java.util.LinkedList;
 
public class BJ1697_BFS {
    static int start,end;
    static Queue<Integer> q = new LinkedList<>();
    static int visited[];
    static int dst[];
    static int MAX = 100001;
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan = new Scanner(System.in);
        visited = new int[MAX];
        dst = new int[MAX];
        start = scan.nextInt();
        end = scan.nextInt();
        
        BFS(start);
    }
 
    static void BFS(int s)
    {
        q.offer(s);
        visited[s] = 1; 
        dst[s] = 0;
        
        while(q.isEmpty()==false) 
        {
            int now = q.poll();
            if(now==end)
                System.out.println(dst[now]);
            if(now-1>=0) 
            {
                if(visited[now-1] == 0)
                {
                q.offer(now-1);
                visited[now-1] = 1;
                dst[now-1] = dst[now]+1;
                }
            }
            if(now+1<MAX) 
            {
                if(visited[now+1] == 0)
                {
                q.offer(now+1);
                visited[now+1] = 1;
                dst[now+1] = dst[now]+1;
                }
            }
            if(now*2<MAX) 
            {
                if(visited[now*2] == 0)
                {
                q.offer(now*2);
                visited[now*2] = 1;
                dst[now*2] = dst[now]+1;
                }
            }
        }
    }
}