Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3361_shift_distance_between_two_strings/Solution.java

@@ -18,12 +18,14 @@ public long shiftDistance(String s, String t, int[] nextCost, int[] previousCost
         }
         for (int i = 0; i < 26; i++) {
             cost = previousCost[i];
-            for (int j = (i == 0 ? 25 : i - 1); j != i; j--) {
+            int j = i == 0 ? 25 : i - 1;
+            while (j != i) {
                 costs[i][j] = Math.min(costs[i][j], cost);
                 cost += previousCost[j];
                 if (j == 0) {
                     j = 26;
                 }
+                j--;
             }
         }
         int n = s.length();

src/main/java/g3301_3400/s3366_minimum_array_sum/Solution.java

@@ -49,9 +49,8 @@ public int minArraySum(int[] nums, int k, int op1, int op2) {
                 }
             }
         }
-        for (int i = high - 1; i >= 0 && op1 > 0; i--) {
+        for (int i = high - 1; i >= 0 && op1 > 0; i--, op1--) {
             nums[i] = (nums[i] + 1) / 2;
-            op1--;
         }
         for (int x : nums) {
             ans += x;

src/main/java/g3301_3400/s3373_maximize_the_number_of_target_nodes_after_connecting_trees_ii/Solution.java

@@ -38,7 +38,9 @@ private int[][] parents(int[][] g, int root) {
         depth[0] = 0;
         int[] q = new int[n];
         q[0] = root;
-        for (int p = 0, r = 1; p < r; p++) {
+        int p = 0;
+        int r = 1;
+        while (p < r) {
             int cur = q[p];
             for (int nex : g[cur]) {
                 if (par[cur] != nex) {
@@ -47,6 +49,7 @@ private int[][] parents(int[][] g, int root) {
                     depth[nex] = depth[cur] + 1;
                 }
             }
+            p++;
         }
         return new int[][] {par, q, depth};
     }