Update Solution.java

Author: javadev

src/main/java/g0701_0800/s0752_open_the_lock/Solution.java

@@ -13,28 +13,21 @@ public int openLock(String[] deadEnds, String target) {
         for (String end : deadEnds) {
             visited.add(Integer.parseInt(end));
         }
-
         if (visited.contains(0)) {
             return -1;
         }
-
         Queue<int[]> queue = new LinkedList<>();
-
         queue.add(new int[] {0, 0});
         visited.add(0);
-
         int numTarget = Integer.parseInt(target);
-
         while (!queue.isEmpty()) {
             int[] node = queue.poll();
             int number = node[0];
             int dist = node[1];
             if (number == numTarget) {
                 return dist;
             }
-
             int[] neighbors = getNeighbors(number);
-
             for (int neighbor : neighbors) {
                 if (visited.contains(neighbor)) {
                     continue;