Fixed style

Author: javadev

src/main/java/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.java

@@ -5,7 +5,9 @@
 public class Solution {
     public int minOperations(int[] nums) {
         for (int num : nums) {
-            if (num != nums[0]) return 1;
+            if (num != nums[0]) {
+                return 1;
+            }
         }
         return 0;
     }

src/main/java/g3601_3700/s3676_count_bowl_subarrays/Solution.java

@@ -15,7 +15,9 @@ public long bowlSubarrays(int[] nums) {
                 int mid = stack.pop();
                 if (!stack.isEmpty()) {
                     int left = stack.peek();
-                    if (Math.min(nums[left], nums[i]) > nums[mid]) ++ans;
+                    if (Math.min(nums[left], nums[i]) > nums[mid]) {
+                        ++ans;
+                    }
                 }
             }
             stack.push(i);

src/main/java/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.java

@@ -5,7 +5,9 @@
 public class Solution {
     private long makePalin(long left, boolean odd) {
         long ans = left;
-        if (odd) left = left >> 1;
+        if (odd) {
+            left = left >> 1;
+        }
         while (left > 0) {
             ans = (ans << 1) | (left & 1);
             left = left >> 1;
@@ -14,7 +16,9 @@ private long makePalin(long left, boolean odd) {
     }
 
     public int countBinaryPalindromes(long n) {
-        if (n == 0) return 1;
+        if (n == 0) {
+            return 1;
+        }
         int len = 64 - Long.numberOfLeadingZeros(n);
         long count = 1;
         for (int i = 1; i < len; i++) {
@@ -25,7 +29,9 @@ public int countBinaryPalindromes(long n) {
         long prefix = n >> (len - half);
         long palin = makePalin(prefix, len % 2 == 1);
         count += (prefix - (1L << (half - 1)));
-        if (palin <= n) ++count;
+        if (palin <= n) {
+            ++count;
+        }
         return (int) count;
     }
 }