Fixed style

Author: javadev

src/main/java/g3101_3200/s3113_find_the_number_of_subarrays_where_boundary_elements_are_maximum/Solution.java

@@ -10,7 +10,9 @@ public long numberOfSubarrays(int[] nums) {
         ArrayDeque<int[]> stack = new ArrayDeque<>();
         long res = 0;
         for (int a : nums) {
-            while (!stack.isEmpty() && stack.peek()[0] < a) stack.pop();
+            while (!stack.isEmpty() && stack.peek()[0] < a) {
+                stack.pop();
+            }
             if (stack.isEmpty() || stack.peek()[0] != a) {
                 stack.push(new int[] {a, 0});
             }

src/main/java/g3101_3200/s3123_find_edges_in_shortest_paths/Solution.java

@@ -31,7 +31,9 @@ public boolean[] findAnswer(int n, int[][] edges) {
         }
         index = 0;
         for (int[] edge : edges) {
-            int u = edge[0], v = edge[1], w = edge[2];
+            int u = edge[0];
+            int v = edge[1];
+            int w = edge[2];
             add(u, v, w);
             add(v, u, w);
         }
@@ -51,7 +53,8 @@ public boolean[] findAnswer(int n, int[][] edges) {
                 break;
             }
             for (int index = head[u]; index != -1; index = next[index]) {
-                int v = edge[index], w = weight[index];
+                int v = edge[index];
+                int w = weight[index];
                 long newDistance = distance + w;
                 if (newDistance < distances[v]) {
                     distances[v] = newDistance;