Fixed style

Author: javadev

src/main/java/g3501_3600/s3567_minimum_absolute_difference_in_sliding_submatrix/Solution.java

@@ -24,7 +24,9 @@ public int[][] minAbsDiff(int[][] grid, int k) {
                 for (int i = 1; i < size; i++) {
                     if (elements[i] != elements[i - 1]) {
                         minDiff = Math.min(minDiff, elements[i] - elements[i - 1]);
-                        if (minDiff == 1) break;
+                        if (minDiff == 1) {
+                            break;
+                        }
                     }
                 }
                 result[x][y] = minDiff == Integer.MAX_VALUE ? 0 : minDiff;

src/main/java/g3501_3600/s3568_minimum_moves_to_clean_the_classroom/Solution.java

@@ -26,12 +26,14 @@ private static class State {
     }
 
     public int minMoves(String[] classroom, int energy) {
-        int m = classroom.length, n = classroom[0].length();
+        int m = classroom.length;
+        int n = classroom[0].length();
         char[][] grid = new char[m][n];
         for (int i = 0; i < m; i++) {
             grid[i] = classroom[i].toCharArray();
         }
-        int startX = -1, startY = -1;
+        int startX = -1;
+        int startY = -1;
         List<int[]> lumetarkon = new ArrayList<>();
         for (int i = 0; i < m; i++) {
             for (int j = 0; j < n; j++) {

src/main/java/g3501_3600/s3569_maximize_count_of_distinct_primes_after_split/Solution.java

@@ -30,12 +30,12 @@ private static class Node {
 
     private static class SegmentTree {
         Node[] tree;
-        int N;
+        int n;
 
         public SegmentTree(int n) {
-            this.N = n;
-            tree = new Node[4 * N];
-            for (int i = 0; i < 4 * N; i++) {
+            this.n = n;
+            tree = new Node[4 * this.n];
+            for (int i = 0; i < 4 * this.n; i++) {
                 tree[i] = new Node();
             }
         }
@@ -52,11 +52,11 @@ private void push(int nodeIdx) {
 
         private void update(int queryStart, int queryEnd, int delta) {
             queryStart = Math.max(1, queryStart);
-            queryEnd = Math.min(N - 1, queryEnd);
+            queryEnd = Math.min(n - 1, queryEnd);
             if (queryStart > queryEnd) {
                 return;
             }
-            update(1, 1, N - 1, queryStart, queryEnd, delta);
+            update(1, 1, n - 1, queryStart, queryEnd, delta);
         }
 
         private void update(
@@ -78,7 +78,7 @@ private void update(
         }
 
         public int queryMax() {
-            if (N - 1 < 1) {
+            if (n - 1 < 1) {
                 return 0;
             }
             return tree[1].maxVal;