Fixed sonar

Author: javadev

src/main/java/g3401_3500/s3500_minimum_cost_to_divide_array_into_subarrays/Solution.java

@@ -4,6 +4,7 @@
 
 import java.util.Arrays;
 
+@SuppressWarnings("java:S107")
 public class Solution {
     public long minimumCost(int[] nums, int[] cost, int k) {
         int n = nums.length;
@@ -49,7 +50,8 @@ private long rec(
             long val =
                     (prefixNums[j] + (long) k * i) * (prefixCost[j + 1] - prefixCost[index])
                             + rec(j + 1, i + 1, nums, prefixNums, prefixCost, k, memo, bestSplit);
-            return memo[index][i] = val;
+            memo[index][i] = val;
+            return val;
         }
         long best = Long.MAX_VALUE;
         int bestIndex = -1;

src/main/java/g3501_3600/s3501_maximize_active_section_with_trade_ii/Solution.java

@@ -19,7 +19,8 @@ public List<Integer> maxActiveSectionsAfterTrade(String s, int[][] queries) {
             }
         }
         List<int[]> segments = new ArrayList<>();
-        for (int i = 0, start = 0; i < n; i++) {
+        int start = 0;
+        for (int i = 0; i < n; i++) {
             if (i == n - 1 || s.charAt(i) != s.charAt(i + 1)) {
                 segments.add(new int[] {start, i - start + 1});
                 start = i + 1;