Improved task 2920

Author: javadev

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

@@ -6,22 +6,19 @@ package g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes
 import kotlin.math.max
 
 class Solution {
-    private lateinit var adjList: Array<MutableList<Int>?>
+    private lateinit var adjList: Array<MutableList<Int>>
     private lateinit var coins: IntArray
     private var k = 0
     private lateinit var dp: Array<IntArray>
 
     private fun init(edges: Array<IntArray>, coins: IntArray, k: Int) {
         val n = coins.size
-        adjList = arrayOfNulls(n)
-        for (v in 0 until n) {
-            adjList[v] = ArrayList()
-        }
+        adjList = Array(n) { ArrayList() }
         for (edge in edges) {
             val u = edge[0]
             val v = edge[1]
-            adjList[u]?.add(v)
-            adjList[v]?.add(u)
+            adjList[u].add(v)
+            adjList[v].add(u)
         }
         this.coins = coins
         this.k = k
@@ -41,7 +38,7 @@ class Solution {
             val coinsV = coins[v] / (1 shl numOfWay2Parents)
             var s0 = coinsV - k
             var s1 = coinsV / 2
-            for (child in adjList[v]!!) {
+            for (child in adjList[v]) {
                 if (child != p) {
                     s0 += rec(child, v, numOfWay2Parents)
                     s1 += rec(child, v, numOfWay2Parents + 1)

src/test/kotlin/com_github_leetcode/CommonUtils.kt

@@ -1,22 +1,6 @@
 package com_github_leetcode
 
-import java.util.Collections
-
 object CommonUtils {
-    fun printArray(nums: IntArray) {
-        for (i in nums) {
-            print("$i, ")
-        }
-        println()
-    }
-
-    fun printArray(nums: DoubleArray) {
-        for (i in nums) {
-            print("$i, ")
-        }
-        println()
-    }
-
     fun compareArray(arr1: IntArray, arr2: IntArray): Boolean {
         for (i in arr1) {
             var include = false
@@ -65,40 +49,6 @@ object CommonUtils {
         return true
     }
 
-    fun convertLeetCodeRegular2DCharArrayInputIntoJavaArray(input: String): Array<CharArray>? {
-        /*
-         * LeetCode 2-d char array usually comes in like this:
-         * ["#"," ","#"],[" "," ","#"],["#","c"," "] which is wrapped in double quotes instead
-         * of single quotes which makes it not usable in Java code.
-         * This method helps with the conversion.
-         */
-        val arrays = input.split("],\\[".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-        val m = arrays.size
-        val n = arrays[1].split(",".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray().size
-        val ans = Array(m) { CharArray(n) }
-        for (i in 0 until m) {
-            if (i == 0) {
-                val str = arrays[i].substring(1)
-                val strs = str.split(",".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-                for (j in strs.indices) {
-                    ans[i][j] = strs[j][1]
-                }
-            } else if (i == m - 1) {
-                val str = arrays[i].substring(0, arrays[i].length - 1)
-                val strs = str.split(",".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-                for (j in strs.indices) {
-                    ans[i][j] = strs[j][1]
-                }
-            } else {
-                val strs = arrays[i].split(",".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-                for (j in strs.indices) {
-                    ans[i][j] = strs[j][1]
-                }
-            }
-        }
-        return ans
-    }
-
     fun convertLeetCodeRegularRectangleArrayInputIntoJavaArray(input: String): Array<IntArray> {
         /*
          * LeetCode 2-d array input usually comes like this: it's a REGULAR rectangle
@@ -185,61 +135,4 @@ object CommonUtils {
         }
         return output.filterNotNull().toTypedArray()
     }
-
-    fun convertLeetCode2DStringArrayInputIntoJavaArray(input: String): MutableList<MutableList<String?>> {
-        /*
-         * How to copy LeetCode 2-d String array into this method:
-         * 1. remove the beginning and ending quotes;
-         * 2. put double quotes into this method parameter;
-         * 3. copy the input into the double quotes.
-         *
-         * LeetCode 2-d array input usually comes like this: each row could have different length
-         * [["A","B"],["C"],["B","C"],["D"]]
-         * The expected input for this method is: "[\"A\",\"B\"],[\"C\"],[\"B\",\"C\"],[\"D\"]"
-         * just copy the LeetCode input: ["A","B"],["C"],["B","C"],["D"] into double quotes in Java,
-         * it'll auto escape the double quotes.
-         * i.e. strip off the beginning and ending square brackets, that's it.
-         * The output of this method will be a standard Java 2-d array.
-         * */
-        val arrays = input.split("],\\[".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-        val result: MutableList<MutableList<String?>> = ArrayList()
-        for (i in arrays.indices) {
-            val level: MutableList<String?> = ArrayList()
-            val strings: Array<String?> = if (i == 0) {
-                arrays[i].substring(1).split(",".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-            } else if (i == arrays.size - 1) {
-                arrays[i].substring(0, arrays[i].length - 1).split(",".toRegex()).dropLastWhile { it.isEmpty() }
-                    .toTypedArray()
-            } else {
-                arrays[i].split(",".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-            }
-            Collections.addAll(level, *strings)
-            result.add(level)
-        }
-        return result
-    }
-
-    fun convertLeetCode1DStringArrayInputIntoJavaArray(input: String): List<String>? {
-        /*
-         * LeetCode 2-d array input usually comes like this: each row could have different length
-         * ["A","B","C"]
-         * The expected input for this method is: "[\"A\",\"B\",\"C\"]"
-         * just copy the LeetCode input: ["A","B","C"] into double quotes in Java,
-         * it'll auto escape the double quotes.
-         * The output of this method will be a standard Java 1-d array.
-         * */
-        val arrays = input.split(",".toRegex()).dropLastWhile { it.isEmpty() }.toTypedArray()
-        val result: MutableList<String> = ArrayList()
-        for (i in arrays.indices) {
-            val word: String = if (i == 0) {
-                arrays[i].substring(1)
-            } else if (i == arrays.size - 1) {
-                arrays[i].substring(0, arrays[i].length - 1)
-            } else {
-                arrays[i]
-            }
-            result.add(word)
-        }
-        return result
-    }
 }

src/test/kotlin/g1901_2000/s1968_array_with_elements_not_equal_to_average_of_neighbors/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g1901_2000.s1968_array_with_elements_not_equal_to_average_of_neighbors
 
-import com_github_leetcode.CommonUtils.compareArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -9,7 +9,7 @@ internal class SolutionTest {
     @Test
     fun rearrangeArray() {
         assertThat(
-            compareArray(
+            CommonUtils.compareArray(
                 Solution().rearrangeArray(intArrayOf(1, 2, 3, 4, 5)), intArrayOf(1, 2, 4, 5, 3)
             ),
             equalTo(true)
@@ -19,7 +19,7 @@ internal class SolutionTest {
     @Test
     fun rearrangeArray2() {
         assertThat(
-            compareArray(
+            CommonUtils.compareArray(
                 Solution().rearrangeArray(intArrayOf(6, 2, 0, 9, 7)), intArrayOf(6, 2, 0, 9, 7)
             ),
             equalTo(true)

src/test/kotlin/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital
 
-import com_github_leetcode.CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -11,7 +11,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumFuelCost(
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[0,1],[0,2],[0,3]"
                     ),
                     5
@@ -25,7 +25,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumFuelCost(
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[3,1],[3,2],[1,0],[0,4],[0,5],[4,6]"
                     ),
                     2

src/test/kotlin/g2401_2500/s2482_difference_between_ones_and_zeros_in_row_and_column/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g2401_2500.s2482_difference_between_ones_and_zeros_in_row_and_column
 
-import com_github_leetcode.CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -11,12 +11,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .onesMinusZeros(
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[0,1,1],[1,0,1],[0,0,1]"
                     )
                 ),
             equalTo(
-                convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                     "[0,0,4],[0,0,4],[-2,-2,2]"
                 )
             )
@@ -28,12 +28,12 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .onesMinusZeros(
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,1,1],[1,1,1]"
                     )
                 ),
             equalTo(
-                convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                     "[5,5,5],[5,5,5]"
                 )
             )

src/test/kotlin/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g2401_2500.s2492_minimum_score_of_a_path_between_two_cities
 
-import com_github_leetcode.CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -12,7 +12,7 @@ internal class SolutionTest {
             Solution()
                 .minScore(
                     4,
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,2,9],[2,3,6],[2,4,5],[1,4,7]"
                     )
                 ),
@@ -26,7 +26,7 @@ internal class SolutionTest {
             Solution()
                 .minScore(
                     4,
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,2,2],[1,3,4],[3,4,7]"
                     )
                 ),

src/test/kotlin/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups
 
-import com_github_leetcode.CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -12,7 +12,7 @@ internal class SolutionTest {
             Solution()
                 .magnificentSets(
                     6,
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,2],[1,4],[1,5],[2,6],[2,3],[4,6]"
                     )
                 ),
@@ -26,7 +26,7 @@ internal class SolutionTest {
             Solution()
                 .magnificentSets(
                     3,
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,2],[2,3],[3,1]"
                     )
                 ),

src/test/kotlin/g2501_2600/s2538_difference_between_maximum_and_minimum_price_sum/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g2501_2600.s2538_difference_between_maximum_and_minimum_price_sum
 
-import com_github_leetcode.CommonUtils.convertLeetCodeRegularRectangleArrayInputIntoJavaArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -12,7 +12,7 @@ internal class SolutionTest {
             Solution()
                 .maxOutput(
                     6,
-                    convertLeetCodeRegularRectangleArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeRegularRectangleArrayInputIntoJavaArray(
                         "[0,1],[1,2],[1,3],[3,4],[3,5]"
                     ),
                     intArrayOf(9, 8, 7, 6, 10, 5)
@@ -27,7 +27,7 @@ internal class SolutionTest {
             Solution()
                 .maxOutput(
                     3,
-                    convertLeetCodeRegularRectangleArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeRegularRectangleArrayInputIntoJavaArray(
                         "[0,1],[1,2]"
                     ),
                     intArrayOf(1, 1, 1)

src/test/kotlin/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree
 
-import com_github_leetcode.CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -12,10 +12,10 @@ internal class SolutionTest {
             Solution()
                 .minOperationsQueries(
                     7,
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[0,1,1],[1,2,1],[2,3,1],[3,4,2],[4,5,2],[5,6,2]"
                     ),
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[0,3],[3,6],[2,6],[0,6]"
                     )
                 ),
@@ -29,10 +29,10 @@ internal class SolutionTest {
             Solution()
                 .minOperationsQueries(
                     8,
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,2,6],[1,3,4],[2,4,6],[2,5,3],[3,6,6],[3,0,8],[7,0,2]"
                     ),
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[4,6],[0,4],[6,5],[7,4]"
                     )
                 ),

src/test/kotlin/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid/SolutionTest.kt

@@ -1,6 +1,6 @@
 package g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid
 
-import com_github_leetcode.CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray
+import com_github_leetcode.CommonUtils
 import org.hamcrest.CoreMatchers.equalTo
 import org.hamcrest.MatcherAssert.assertThat
 import org.junit.jupiter.api.Test
@@ -11,7 +11,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumMoves(
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,1,0],[1,1,1],[1,2,1]"
                     )
                 ),
@@ -24,7 +24,7 @@ internal class SolutionTest {
         assertThat(
             Solution()
                 .minimumMoves(
-                    convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
+                    CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray(
                         "[1,3,0],[1,0,0],[1,0,3]"
                     )
                 ),