Fixed sonar

Author: javadev

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

@@ -17,7 +17,8 @@ public long numGoodSubarrays(int[] nums, int k) {
             res += cnt.getOrDefault(pre, 0L);
             cnt.put(pre, cnt.getOrDefault(pre, 0L) + 1L);
         }
-        for (int i = 0; i < n; ) {
+        int i = 0;
+        while (i < n) {
             int j = i;
             while (j < n && nums[j] == nums[i]) {
                 ++j;