Fixed sonar

Author: javadev

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

@@ -16,8 +16,8 @@ class Solution {
         for (coord in coords) {
             val x = coord[0]
             val y = coord[1]
-            xMap.computeIfAbsent(x) { k: Int -> TreeSet<Int>() }.add(y)
-            yMap.computeIfAbsent(y) { k: Int -> TreeSet<Int>() }.add(x)
+            xMap.computeIfAbsent(x) { _: Int -> TreeSet<Int>() }.add(y)
+            yMap.computeIfAbsent(y) { _: Int -> TreeSet<Int>() }.add(x)
             allX.add(x)
             allY.add(y)
         }

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

@@ -41,15 +41,15 @@ class Solution {
                 ms.put(nums[r], ms.getOrDefault(nums[r], 0) + 1)
                 primeIndices.add(r)
             }
-            while (!ms.isEmpty() && ms.lastKey()!! - ms.firstKey()!! > k) {
+            while (ms.isNotEmpty() && ms.lastKey()!! - ms.firstKey()!! > k) {
                 if (nums[l] < MAXN && isPrime[nums[l]]) {
-                    val count: Int = ms.get(nums[l])!!
+                    val count: Int = ms[nums[l]]!!
                     if (count == 1) {
                         ms.remove(nums[l])
                     } else {
                         ms.put(nums[l], count - 1)
                     }
-                    if (!primeIndices.isEmpty() && primeIndices[0] == l) {
+                    if (primeIndices.isNotEmpty() && primeIndices[0] == l) {
                         primeIndices.removeAt(0)
                     }
                 }

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

@@ -32,7 +32,7 @@ class Solution {
             )
         dis[0][0][0] = 0.0
         pq.add(doubleArrayOf(0.0, 0.0, 0.0, 0.0))
-        while (!pq.isEmpty()) {
+        while (pq.isNotEmpty()) {
             val cur = pq.poll()
             val far = cur[0]
             val ma = cur[1].toInt()