Fixed style

Author: javadev

src/main/java/g3201_3300/s3248_snake_in_matrix/Solution.java

@@ -11,16 +11,24 @@ public int finalPositionOfSnake(int n, List<String> commands) {
         for (String command : commands) {
             switch (command) {
                 case "UP":
-                    if (x > 0) x--;
+                    if (x > 0) {
+                        x--;
+                    }
                     break;
                 case "DOWN":
-                    if (x < n - 1) x++;
+                    if (x < n - 1) {
+                        x++;
+                    }
                     break;
                 case "LEFT":
-                    if (y > 0) y--;
+                    if (y > 0) {
+                        y--;
+                    }
                     break;
                 case "RIGHT":
-                    if (y < n - 1) y++;
+                    if (y < n - 1) {
+                        y++;
+                    }
                     break;
             }
         }

src/main/java/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i/Solution.java

@@ -11,7 +11,9 @@ public int countOfPairs(int[] nums) {
         for (int i = 1; i < nums.length; i++) {
             currShift = Math.max(currShift, nums[i] - maxShift[i - 1]);
             maxShift[i] = Math.min(maxShift[i - 1], nums[i] - currShift);
-            if (maxShift[i] < 0) return 0;
+            if (maxShift[i] < 0) {
+                return 0;
+            }
         }
         int[][] cases = getAllCases(nums, maxShift);
         return cases[nums.length - 1][maxShift[nums.length - 1]];