Fixed style

Author: javadev

src/main/java/g3201_3300/s3208_alternating_groups_ii/Solution.java

@@ -4,7 +4,9 @@
 
 public class Solution {
     public int numberOfAlternatingGroups(int[] colors, int k) {
-        int i = 0, len = 0, total = 0;
+        int i = 0;
+        int len = 0;
+        int total = 0;
         while (i < colors.length - 1) {
             int j = i + 1;
             if (colors[j] != colors[i]) {
@@ -14,7 +16,9 @@ public int numberOfAlternatingGroups(int[] colors, int k) {
                     j++;
                     len++;
                 }
-                if (j == colors.length) break;
+                if (j == colors.length) {
+                    break;
+                }
                 total += Math.max(0, (len - k + 1));
             }
             i = j;
@@ -30,7 +34,9 @@ public int numberOfAlternatingGroups(int[] colors, int k) {
                 j++;
                 len++;
             }
-            if (j >= k) len -= (j - k + 1);
+            if (j >= k) {
+                len -= (j - k + 1);
+            }
         }
         total += Math.max(0, (len - k + 1));
         return total;

src/main/java/g3201_3300/s3212_count_submatrices_with_equal_frequency_of_x_and_y/Solution.java

@@ -4,13 +4,15 @@
 
 public class Solution {
     public int numberOfSubmatrices(char[][] grid) {
-        int m = grid.length, n = grid[0].length, ans = 0;
+        int m = grid.length;
+        int n = grid[0].length;
+        int ans = 0;
         int[][] row = new int[n][2];
-        for (int i = 0; i < m; i++) {
+        for (char[] chars : grid) {
             int[] count = new int[2];
             for (int j = 0; j < n; j++) {
-                if (grid[i][j] != '.') {
-                    count[grid[i][j] - 'X']++;
+                if (chars[j] != '.') {
+                    count[chars[j] - 'X']++;
                 }
                 row[j][0] += count[0];
                 row[j][1] += count[1];