Fixed sonar

Author: javadev

src/main/kotlin/g3501_3600/s3568_minimum_moves_to_clean_the_classroom/Solution.kt

@@ -42,7 +42,7 @@ class Solution {
         queue.offer(State(startX, startY, energy, 0, 0))
         visited[startX][startY][0] = energy
         val dirs = arrayOf<IntArray>(intArrayOf(0, 1), intArrayOf(1, 0), intArrayOf(0, -1), intArrayOf(-1, 0))
-        while (!queue.isEmpty()) {
+        while (queue.isNotEmpty()) {
             val curr = queue.poll()
             if (curr.mask == allMask) {
                 return curr.steps

src/main/kotlin/g3501_3600/s3569_maximize_count_of_distinct_primes_after_split/Solution.kt

@@ -77,7 +77,7 @@ class Solution {
         val primeIndices: MutableMap<Int, TreeSet<Int>> = HashMap()
         for (i in 0..<n) {
             if (isPrime[nums[i]]) {
-                primeIndices.computeIfAbsent(nums[i]) { k: Int? -> TreeSet<Int>() }.add(i)
+                primeIndices.computeIfAbsent(nums[i]) { _: Int -> TreeSet<Int>() }.add(i)
             }
         }
         val segmentTree = SegmentTree(n)
@@ -115,7 +115,7 @@ class Solution {
             nums[idx] = `val`
             if (isPrime[`val`]) {
                 val wasNewPrime = !primeIndices.containsKey(`val`)
-                val indices = primeIndices.computeIfAbsent(`val`) { k: Int? -> TreeSet<Int>() }
+                val indices = primeIndices.computeIfAbsent(`val`) { _: Int -> TreeSet<Int>() }
                 val oldFirst: Int = (if (indices.isEmpty()) -1 else indices.first())!!
                 val oldLast: Int = (if (indices.isEmpty()) -1 else indices.last())!!
                 indices.add(idx)