Fixed style

Author: javadev

src/main/java/g3701_3800/s3729_count_distinct_subarrays_divisible_by_k_in_sorted_array/Solution.java

@@ -19,7 +19,9 @@ public long numGoodSubarrays(int[] nums, int k) {
         }
         for (int i = 0; i < n; ) {
             int j = i;
-            while (j < n && nums[j] == nums[i]) ++j;
+            while (j < n && nums[j] == nums[i]) {
+                ++j;
+            }
             int l = j - i;
             for (int ll = 1; ll < l; ++ll) {
                 if ((long) ll * nums[i] % k == 0) {