Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3452_sum_of_good_numbers/Solution.java

@@ -8,15 +8,11 @@ public int sumOfGoodNumbers(int[] nums, int k) {
         int n = nums.length;
         for (int i = 0; i < n; i++) {
             boolean isGood = true;
-            if (i - k >= 0) {
-                if (nums[i] <= nums[i - k]) {
-                    isGood = false;
-                }
+            if (i - k >= 0 && nums[i] <= nums[i - k]) {
+                isGood = false;
             }
-            if (i + k < n) {
-                if (nums[i] <= nums[i + k]) {
-                    isGood = false;
-                }
+            if (i + k < n && nums[i] <= nums[i + k]) {
+                isGood = false;
             }
             if (isGood) {
                 totalSum += nums[i];

src/main/java/g3401_3500/s3454_separate_squares_ii/Solution.java

@@ -70,7 +70,8 @@ private double findSplitPoint(Event[] events, double[] xs, int m, double target)
         SegmentTree segTree = new SegmentTree(xs);
         double lastY = events[0].y;
         double cumArea = 0.0;
-        for (int i = 0; i < m; ) {
+        int i = 0;
+        while (i < m) {
             double curY = events[i].y;
             if (curY > lastY) {
                 double unionX = segTree.query();

src/main/java/g3401_3500/s3455_shortest_matching_substring/Solution.java

@@ -2,6 +2,7 @@
 
 // #Hard #2025_02_16_Time_976_ms_(100.00%)_Space_45.76_MB_(100.00%)
 
+@SuppressWarnings("java:S6541")
 public class Solution {
     public int shortestMatchingSubstring(String s, String p) {
         int minLen = Integer.MAX_VALUE;

src/main/java/g3401_3500/s3458_select_k_disjoint_special_substrings/Solution.java

@@ -5,9 +5,7 @@
 import java.util.Arrays;
 
 public class Solution {
-    public boolean maxSubstringLength(String s, int k) {
-        char[] arr = s.toCharArray();
-        int n = arr.length;
+    private int[][] buildFrequencyArray(char[] arr, int n) {
         int[][] freq = new int[2][26];
         for (int[] is : freq) {
             Arrays.fill(is, -1);
@@ -19,6 +17,10 @@ public boolean maxSubstringLength(String s, int k) {
             }
             freq[1][x] = i;
         }
+        return freq;
+    }
+
+    private void updateFrequencyBounds(int[][] freq, char[] arr) {
         for (int i = 0; i < 26; i++) {
             if (freq[0][i] == -1) {
                 continue;
@@ -32,6 +34,9 @@ public boolean maxSubstringLength(String s, int k) {
             freq[1][i] = max;
             freq[0][i] = min;
         }
+    }
+
+    private int[][] buildTempArray(int[][] freq) {
         int[][] temp = new int[2][26];
         int x = 0;
         for (int i = 0; i < 26; i++) {
@@ -44,11 +49,10 @@ public boolean maxSubstringLength(String s, int k) {
                 x++;
             }
         }
-        int[][] nums = new int[x][2];
-        for (int i = 0; i < x; i++) {
-            nums[i][0] = temp[0][i];
-            nums[i][1] = temp[1][i];
-        }
+        return new int[][] {temp[0], temp[1], new int[] {x}};
+    }
+
+    private int[][] processIntervals(int[][] nums, int x) {
         Arrays.sort(nums, (a, b) -> a[0] - b[0]);
         int[][] ans = new int[x][2];
         int y = 0;
@@ -71,6 +75,25 @@ public boolean maxSubstringLength(String s, int k) {
                 }
             }
         }
+        return new int[][] {ans[0], new int[] {y}};
+    }
+
+    public boolean maxSubstringLength(String s, int k) {
+        char[] arr = s.toCharArray();
+        int n = arr.length;
+        int[][] freq = buildFrequencyArray(arr, n);
+        updateFrequencyBounds(freq, arr);
+        int[][] tempResult = buildTempArray(freq);
+        int[][] temp = new int[][] {tempResult[0], tempResult[1]};
+        int x = tempResult[2][0];
+        int[][] nums = new int[x][2];
+        for (int i = 0; i < x; i++) {
+            nums[i][0] = temp[0][i];
+            nums[i][1] = temp[1][i];
+        }
+        int[][] processedResult = processIntervals(nums, x);
+        int[][] ans = new int[][] {processedResult[0]};
+        int y = processedResult[1][0];
         if (y >= k) {
             if (y == 1 && k == 1) {
                 return ans[0][0] != 0 || ans[0][1] != n - 1;