Fixed sonar

Author: javadev

src/main/java/g3301_3400/s3302_find_the_lexicographically_smallest_valid_sequence/Solution.java

@@ -10,30 +10,28 @@ public int[] validSequence(String word1, String word2) {
         int m = word2.length();
         int[] revGreedyMatchInd = new int[m];
         Arrays.fill(revGreedyMatchInd, -1);
-        {
-            int i = n - 1;
-            int j = m - 1;
-            while (j >= 0 && i >= 0) {
-                if (word1.charAt(i) == word2.charAt(j)) {
-                    revGreedyMatchInd[j--] = i;
-                }
-                i--;
+        int i = n - 1;
+        int j = m - 1;
+        while (j >= 0 && i >= 0) {
+            if (word1.charAt(i) == word2.charAt(j)) {
+                revGreedyMatchInd[j--] = i;
             }
+            i--;
         }
         boolean canSkip = true;
-        int j = 0;
-        int i = 0;
-        while (i < n && j < m && m - j <= n - i) {
-            if (word1.charAt(i) == word2.charAt(j)) {
-                revGreedyMatchInd[j++] = i;
-            } else if (canSkip && (j == m - 1 || i < revGreedyMatchInd[j + 1])) {
-                revGreedyMatchInd[j++] = i;
+        int j1 = 0;
+        int i1 = 0;
+        while (i1 < n && j1 < m && m - j1 <= n - i1) {
+            if (word1.charAt(i1) == word2.charAt(j1)) {
+                revGreedyMatchInd[j1++] = i1;
+            } else if (canSkip && (j1 == m - 1 || i1 < revGreedyMatchInd[j1 + 1])) {
+                revGreedyMatchInd[j1++] = i1;
                 canSkip = false;
-            } else if (!canSkip && revGreedyMatchInd[j] == -1) {
+            } else if (!canSkip && revGreedyMatchInd[j1] == -1) {
                 break;
             }
-            i++;
+            i1++;
         }
-        return j == m ? revGreedyMatchInd : new int[0];
+        return j1 == m ? revGreedyMatchInd : new int[0];
     }
 }

src/main/java/g3301_3400/s3304_find_the_k_th_character_in_string_game_i/Solution.java

@@ -12,7 +12,7 @@ public char kthCharacter(int k) {
             s = sb.toString();
             char[] cq = s.toCharArray();
             for (char c1 : cq) {
-                int ascii = (int) c1;
+                int ascii = c1;
                 c1 = (char) (ascii + 1);
                 sb.append(c1);
             }

src/main/java/g3301_3400/s3307_find_the_k_th_character_in_string_game_ii/Solution.java

@@ -7,7 +7,6 @@ public char kthCharacter(long k, int[] operations) {
         if (k == 1) {
             return 'a';
         }
-        int n = operations.length;
         long len = 1;
         long newK = -1;
         int operation = -1;