Fixed style

Author: javadev

src/main/java/g3401_3500/s3425_longest_special_path/Solution.java

@@ -24,7 +24,9 @@ public int[] longestSpecialPath(int[][] edges, int[] nums) {
             adj[i] = new ArrayList<>();
         }
         for (int[] e : edges) {
-            int u = e[0], v = e[1], w = e[2];
+            int u = e[0];
+            int v = e[1];
+            int w = e[2];
             adj[u].add(new int[] {v, w});
             adj[v].add(new int[] {u, w});
         }
@@ -49,8 +51,11 @@ public int[] longestSpecialPath(int[][] edges, int[] nums) {
     private void buildDist(int u, int parent, int currDist) {
         dist[u] = currDist;
         for (int[] edge : adj[u]) {
-            int v = edge[0], w = edge[1];
-            if (v == parent) continue;
+            int v = edge[0];
+            int w = edge[1];
+            if (v == parent) {
+                continue;
+            }
             buildDist(v, u, currDist + w);
         }
     }
@@ -78,7 +83,9 @@ private void dfs(int u, int parent) {
         }
         for (int[] edge : adj[u]) {
             int v = edge[0];
-            if (v == parent) continue;
+            if (v == parent) {
+                continue;
+            }
             dfs(v, u);
         }
         pathStack.remove(pathStack.size() - 1);

src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.java

@@ -4,26 +4,30 @@
 
 public class Solution {
     private long comb(long a, long b, long mod) {
-        if (b > a) return 0;
-        long numer = 1, denom = 1;
+        if (b > a) {
+            return 0;
+        }
+        long numer = 1;
+        long denom = 1;
         for (long i = 0; i < b; ++i) {
             numer = numer * (a - i) % mod;
             denom = denom * (i + 1) % mod;
         }
-        long denom_inv = 1;
+        long denomInv = 1;
         long exp = mod - 2;
         while (exp > 0) {
             if (exp % 2 > 0) {
-                denom_inv = denom_inv * denom % mod;
+                denomInv = denomInv * denom % mod;
             }
             denom = denom * denom % mod;
             exp /= 2;
         }
-        return numer * denom_inv % mod;
+        return numer * denomInv % mod;
     }
 
     public int distanceSum(int m, int n, int k) {
-        long res = 0, mod = 1000000007;
+        long res = 0;
+        long mod = 1000000007;
         long base = comb((long) m * n - 2, k - 2, mod);
         for (int d = 1; d < n; ++d) {
             res = (res + (long) d * (n - d) % mod * m % mod * m % mod) % mod;