Update Solution.java

Author: javadev

src/main/java/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/Solution.java

@@ -15,23 +15,18 @@ public int[] restoreArray(int[][] adjacentPairs) {
         if (adjacentPairs.length == 1) {
             return adjacentPairs[0];
         }
-
         Map<Integer, List<Integer>> graph = new HashMap<>();
-
         for (int[] pair : adjacentPairs) {
             graph.computeIfAbsent(pair[0], k -> new ArrayList<>()).add(pair[1]);
             graph.computeIfAbsent(pair[1], k -> new ArrayList<>()).add(pair[0]);
         }
-
         int[] res = new int[graph.size()];
-
         for (Map.Entry<Integer, List<Integer>> entry : graph.entrySet()) {
             if (entry.getValue().size() == 1) {
                 res[0] = entry.getKey();
                 break;
             }
         }
-
         res[1] = graph.get(res[0]).get(0);
         for (int i = 2; i < res.length; i++) {
             for (int cur : graph.get(res[i - 1])) {
@@ -41,7 +36,6 @@ public int[] restoreArray(int[][] adjacentPairs) {
                 }
             }
         }
-
         return res;
     }
 }