1115

djs02027 · djs02027 · commit ad8022f691c5 · 2022-11-15T22:00:20.000+09:00
diff --git a/BOJ/gold/BOJ13913/src/Main.java b/BOJ/gold/BOJ13913/src/Main.java
@@ -1,59 +1,64 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
 import java.util.*;
 
 public class Main {
-    static  int [] visited;
-
-    static  ArrayList<Integer> result;
-    public static void main(String[] args) {
-
-        Scanner sc = new Scanner(System.in);
-        int N = sc.nextInt();
-        int K = sc.nextInt();
-        visited = new  int [100001];
+    static ArrayList<Integer> result = new ArrayList<>();
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        String [] s = br.readLine().split(" ");
+        int subin = Integer.parseInt(s[0]);
+        int syster = Integer.parseInt(s[1]);
+        int [] visited = new int [100001];
         Arrays.fill(visited, -1);
-        result=new ArrayList<>();
-        int time = BFS(N,K);
-        System.out.println(time);
-        for(int i= result.size()-1; i>=0; i--){
+        int count= BFS(subin,syster,visited);
+        System.out.println(count);
+        for (int i = result.size()-1; i >=0 ; i--) {
             System.out.print(result.get(i)+" ");
         }
+
+
     }
 
-    private static int BFS(int n, int k) {
+    private static int BFS(int subin, int syster, int[] visited) {
         Deque<int []> dq = new LinkedList<>();
-        dq.offer(new int []{n,0});
-        visited[n]=n;
-        while (!dq.isEmpty()){
-            int [] now = dq.pollFirst();
+        dq.add(new int[]{subin,0});
+        while (!dq.isEmpty()) {
+            int[] now = dq.pollFirst();
             int place = now[0];
             int time = now[1];
-
-            if (place==k){
-                int idx =place;
-                while (idx!=n){
-                    if(idx == n){
+            if (place == syster) {
+                int idx = place;
+                while (idx != subin) {
+                    if (idx == subin) {
                         break;
                     }
                     result.add(idx);
-                    idx=visited[idx];
+                    idx = visited[idx];
                 }
-                result.add(n);
+                result.add(idx);
                 return time;
 
+
             }
-            if (0<=place-1&& visited[place-1]==-1){
-                dq.offer(new int []{place-1,time+1});
-                visited[place-1]=place;
+            if (place - 1 >= 0 && place - 1 < 100001 && visited[place - 1] == -1) {
+                dq.add(new int[]{place - 1, time + 1});
+                visited[place - 1] = place;
             }
-            if (place+1<100001 && visited[place+1]==-1){
-                dq.offer(new int []{place+1,time+1});
-                visited[place+1]=place;
+            if (place + 1 >= 0 && place + 1 < 100001 && visited[place + 1] == -1) {
+                dq.add(new int[]{place + 1, time + 1});
+                visited[place + 1] = place;
             }
-            if(place*2<100001 && visited[place*2]==-1){
-                dq.offer(new int []{place*2,time+1});
-                visited[place*2]=place;
+            if (place * 2 >= 0 && place * 2 < 100001 && visited[place * 2] == -1) {
+                dq.add(new int[]{place * 2, time + 1});
+                visited[place * 2] = place;
             }
+
+
         }
-        return n;
+        return -1;
     }
+
+
 }
