Fixed sonar

Author: javadev

src/main/java/g3201_3300/s3241_time_taken_to_mark_all_nodes/Solution.java

@@ -20,7 +20,9 @@ public int[] timeTaken(int[][] edges) {
         nxt = new int[n << 1];
         to = new int[n << 1];
         Arrays.fill(head, -1);
-        for (int i = 0, j = 2; i < edges.length; i++) {
+        int i = 0;
+        int j = 2;
+        while (i < edges.length) {
             int u = edges[i][0];
             int v = edges[i][1];
             nxt[j] = head[u];
@@ -31,6 +33,7 @@ public int[] timeTaken(int[][] edges) {
             head[v] = j;
             to[j] = u;
             j++;
+            i++;
         }
         last = new int[n];
         lastNo = new int[n];

src/main/java/g3201_3300/s3245_alternating_groups_iii/Solution.java

@@ -208,7 +208,8 @@ private int prev(long set, int n) {
         }
 
         public int next(int pos) {
-            for (int i = 0; i < set.length && pos >>> 6 < set[i].length; i++, pos >>>= 6, pos++) {
+            int i = 0;
+            while (i < set.length && pos >>> 6 < set[i].length) {
                 int nex = next(set[i][pos >>> 6], pos & 63);
                 if (nex != -1) {
                     pos = pos >>> 6 << 6 | nex;
@@ -217,6 +218,9 @@ public int next(int pos) {
                     }
                     return pos;
                 }
+                i++;
+                pos >>>= 6;
+                pos++;
             }
             return -1;
         }