Fixed sonar

Author: javadev

src/main/kotlin/g3301_3400/s3341_find_minimum_time_to_reach_last_room_i/Solution.kt

@@ -21,7 +21,7 @@ class Solution {
         minHeap.offer(intArrayOf(0, 0, 0))
         time[0][0] = 0
         val directions = arrayOf<IntArray>(intArrayOf(1, 0), intArrayOf(-1, 0), intArrayOf(0, 1), intArrayOf(0, -1))
-        while (!minHeap.isEmpty()) {
+        while (minHeap.isNotEmpty()) {
             val current = minHeap.poll()
             val currentTime = current[0]
             val x = current[1]

src/main/kotlin/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii/Solution.kt

@@ -29,7 +29,7 @@ class Solution {
         node.turn = 0
         pq.add(node)
         moveTime[0][0] = -1
-        while (!pq.isEmpty()) {
+        while (pq.isNotEmpty()) {
             val curr = pq.poll()
             for (i in 0..3) {
                 val x = curr.x + dir[i]!![0]