Fixed style

Author: javadev

src/main/java/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii/Solution.java

@@ -3,7 +3,8 @@
 // #Hard #Array #Matrix #Enumeration #2024_06_26_Time_10_ms_(99.66%)_Space_44.1_MB_(85.42%)
 
 public class Solution {
-    private int[][] ruc; // rectangle unit count
+    // rectangle unit count
+    private int[][] ruc;
     private int height;
     private int width;
 
@@ -13,67 +14,93 @@ private int unitsInRectangle(int r0, int c0, int r1, int c1) {
     }
 
     private int minArea(int r0, int c0, int r1, int c1) {
-        if (unitsInRectangle(r0, c0, r1, c1) == 0) return 0;
+        if (unitsInRectangle(r0, c0, r1, c1) == 0) {
+            return 0;
+        }
         int minRow = r0;
-        while (unitsInRectangle(r0, c0, minRow + 1, c1) == 0) minRow++;
+        while (unitsInRectangle(r0, c0, minRow + 1, c1) == 0) {
+            minRow++;
+        }
         int maxRow = r1 - 1;
-        while (unitsInRectangle(maxRow, c0, r1, c1) == 0) maxRow--;
+        while (unitsInRectangle(maxRow, c0, r1, c1) == 0) {
+            maxRow--;
+        }
         int minCol = c0;
-        while (unitsInRectangle(r0, c0, r1, minCol + 1) == 0) minCol++;
+        while (unitsInRectangle(r0, c0, r1, minCol + 1) == 0) {
+            minCol++;
+        }
         int maxCol = c1 - 1;
-        while (unitsInRectangle(r0, maxCol, r1, c1) == 0) maxCol--;
+        while (unitsInRectangle(r0, maxCol, r1, c1) == 0) {
+            maxCol--;
+        }
         return (maxRow - minRow + 1) * (maxCol - minCol + 1);
     }
 
     private int minSum2(int r0, int c0, int r1, int c1, boolean splitVertical) {
         int min = Integer.MAX_VALUE;
-        if (splitVertical)
+        if (splitVertical) {
             for (int c = c0 + 1; c < c1; c++) {
                 int a1 = minArea(r0, c0, r1, c);
                 if (a1 == 0) continue;
                 int a2 = minArea(r0, c, r1, c1);
                 if (a2 != 0) min = Math.min(min, a1 + a2);
             }
-        else
+        } else
             for (int r = r0 + 1; r < r1; r++) {
                 int a1 = minArea(r0, c0, r, c1);
-                if (a1 == 0) continue;
+                if (a1 == 0) {
+                    continue;
+                }
                 int a2 = minArea(r, c0, r1, c1);
-                if (a2 != 0) min = Math.min(min, a1 + a2);
+                if (a2 != 0) {
+                    min = Math.min(min, a1 + a2);
+                }
             }
         return min;
     }
 
     private int minSum3(
             boolean firstSplitVertical, boolean takeLower, boolean secondSplitVertical) {
         int min = Integer.MAX_VALUE;
-        if (firstSplitVertical)
+        if (firstSplitVertical) {
             for (int c = 1; c < width; c++) {
-                int a1, a2;
+                int a1;
+                int a2;
                 if (takeLower) {
                     a1 = minArea(0, 0, height, c);
-                    if (a1 == 0) continue;
+                    if (a1 == 0) {
+                        continue;
+                    }
                     a2 = minSum2(0, c, height, width, secondSplitVertical);
                 } else {
                     a1 = minArea(0, c, height, width);
-                    if (a1 == 0) continue;
+                    if (a1 == 0) {
+                        continue;
+                    }
                     a2 = minSum2(0, 0, height, c, secondSplitVertical);
                 }
                 if (a2 != Integer.MAX_VALUE) min = Math.min(min, a1 + a2);
             }
-        else
+        } else
             for (int r = 1; r < height; r++) {
-                int a1, a2;
+                int a1;
+                int a2;
                 if (takeLower) {
                     a1 = minArea(0, 0, r, width);
-                    if (a1 == 0) continue;
+                    if (a1 == 0) {
+                        continue;
+                    }
                     a2 = minSum2(r, 0, height, width, secondSplitVertical);
                 } else {
                     a1 = minArea(r, 0, height, width);
-                    if (a1 == 0) continue;
+                    if (a1 == 0) {
+                        continue;
+                    }
                     a2 = minSum2(0, 0, r, width, secondSplitVertical);
                 }
-                if (a2 != Integer.MAX_VALUE) min = Math.min(min, a1 + a2);
+                if (a2 != Integer.MAX_VALUE) {
+                    min = Math.min(min, a1 + a2);
+                }
             }
         return min;
     }