Fixed style

Author: javadev

src/main/java/g3501_3600/s3536_maximum_product_of_two_digits/Solution.java

@@ -11,7 +11,9 @@ public int maxProduct(int n) {
         while (n > 0) {
             int a = n % 10;
             if (a > m1) {
-                if (m1 > m2) m2 = m1;
+                if (m1 > m2) {
+                    m2 = m1;
+                }
                 m1 = a;
             } else {
                 if (a > m2) {

src/main/java/g3501_3600/s3538_merge_operations_for_minimum_travel_time/Solution.java

@@ -19,7 +19,9 @@ public int minTravelTime(int l, int n, int k, int[] position, int[] time) {
             for (int curr = 0; curr <= k && curr <= i; curr++) {
                 currTime += time[i - curr];
                 for (int used = 0; used <= k; used++) {
-                    if (dp[i][curr][used] == Integer.MAX_VALUE) continue;
+                    if (dp[i][curr][used] == Integer.MAX_VALUE) {
+                        continue;
+                    }
                     for (int next = 0; next <= k - used && next <= n - i - 2; next++) {
                         int nextI = i + next + 1;
                         dp[nextI][next][next + used] =

src/main/java/g3501_3600/s3539_find_sum_of_array_product_of_magical_sequences/Solution.java

@@ -18,7 +18,8 @@ public int magicalSum(int m, int k, int[] nums) {
                 pow[j][c] = pow[j][c - 1] * nums[j] % MOD;
             }
         }
-        long[][][] dp = new long[m + 1][k + 1][m + 1], next = new long[m + 1][k + 1][m + 1];
+        long[][][] dp = new long[m + 1][k + 1][m + 1];
+        long[][][] next = new long[m + 1][k + 1][m + 1];
         dp[0][0][0] = 1L;
         for (int i = 0; i < n; i++) {
             for (int t = 0; t <= m; t++) {
@@ -29,10 +30,14 @@ public int magicalSum(int m, int k, int[] nums) {
             for (int t = 0; t <= m; t++) {
                 for (int o = 0; o <= k; o++) {
                     for (int c = 0; c <= m; c++) {
-                        if (dp[t][o][c] == 0) continue;
+                        if (dp[t][o][c] == 0) {
+                            continue;
+                        }
                         for (int cc = 0; cc <= m - t; cc++) {
                             int total = c + cc;
-                            if (o + (total & 1) > k) continue;
+                            if (o + (total & 1) > k) {
+                                continue;
+                            }
                             next[t + cc][o + (total & 1)][total >>> 1] =
                                     (next[t + cc][o + (total & 1)][total >>> 1]
                                                     + dp[t][o][c]