Improved tasks 2973, 2983

Author: javadev

src/main/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.kt

@@ -47,11 +47,11 @@ class Solution {
         for (ne in next) {
             if (ne != p) {
                 val r = dp(g, cost, ne, i)
-                while (!r.min!!.isEmpty()) {
+                while (r.min!!.isNotEmpty()) {
                     val a = r.min!!.poll()
                     pq2.add(a)
                 }
-                while (!r.max!!.isEmpty()) {
+                while (r.max!!.isNotEmpty()) {
                     val a = r.max!!.poll()
                     pq.add(a)
                 }
@@ -60,11 +60,11 @@ class Solution {
         if (pq.size + pq2.size < 3) {
             result[i] = 1
         } else {
-            val a = if (!pq.isEmpty()) pq.poll() else 0
-            val b = if (!pq.isEmpty()) pq.poll() else 0
-            val c = if (!pq.isEmpty()) pq.poll() else 0
-            val aa = if (!pq2.isEmpty()) pq2.poll() else 0
-            val bb = if (!pq2.isEmpty()) pq2.poll() else 0
+            val a = if (pq.isNotEmpty()) pq.poll() else 0
+            val b = if (pq.isNotEmpty()) pq.poll() else 0
+            val c = if (pq.isNotEmpty()) pq.poll() else 0
+            val aa = if (pq2.isNotEmpty()) pq2.poll() else 0
+            val bb = if (pq2.isNotEmpty()) pq2.poll() else 0
             result[i] = max(0, (a.toLong() * b * c))
             result[i] = max(result[i], max(0, (a.toLong() * aa * bb)))
                 .toLong()

src/main/kotlin/g2901_3000/s2983_palindrome_rearrangement_queries/Solution.kt

@@ -65,7 +65,7 @@ class Solution {
             // in the left half to match the right end of the right interval, this
             // means we do not need the right end of the right interval to go too far
             while (mp.containsKey(s[rptr]) ||
-                (rptr >= n / 2 && s[rptr] == s[opp(rptr)] && mp.size == 0)
+                (rptr >= n / 2 && s[rptr] == s[opp(rptr)] && mp.isEmpty())
             ) {
                 mp.computeIfPresent(s[rptr]) { _: Char?, v: Int -> if (v == 1) null else v - 1 }
                 rptr--
@@ -79,7 +79,7 @@ class Solution {
         for (i in opp(problemPoint) downTo n / 2) {
             mp.compute(s[i]) { _: Char?, v: Int? -> if (v == null) 1 else v + 1 }
             while (mp.containsKey(s[lptr]) ||
-                (lptr < n / 2 && s[lptr] == s[opp(lptr)] && mp.size == 0)
+                (lptr < n / 2 && s[lptr] == s[opp(lptr)] && mp.isEmpty())
             ) {
                 mp.computeIfPresent(s[lptr]) { _: Char?, v: Int -> if (v == 1) null else v - 1 }
                 lptr++