BEAKJOON JAVA ALGORITHM #1697(숨바꼭질)

https://www.acmicpc.net/problem/1697

import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class a1697 { public static final int max = 100000; public static void main(String[] args) { Scanner sc = new Scanner(System.in); int s = sc.nextInt(); int y = sc.nextInt(); boolean[] check = new boolean[max+1]; int[] dist = new int[max+1]; check[s] = true; dist[s] = 0; Queue<Integer> q = new LinkedList<>(); q.add(s); while(!q.isEmpty()) { int now = q.remove(); if(now-1 >= 0) { if(check[now-1] == false) { q.add(now-1); check[now-1] = true; dist[now-1] = dist[now] + 1; } } if(now+1 <= max) { if(check[now+1] == false) { q.add(now+1); check[now+1] = true; dist[now+1] = dist[now] + 1; } } if(now*2 <= max) { if(check[now*2] == false) { q.add(now*2); check[now*2] = true; dist[now*2] = dist[now] + 1; } } } System.out.println(dist[y]); } }