Improved tags

Author: javadev

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

@@ -1,6 +1,6 @@
 package g3301_3400.s3386_button_with_longest_push_time
 
-// #Easy #2024_12_15_Time_0_ms_(100.00%)_Space_44.6_MB_(100.00%)
+// #Easy #2024_12_15_Time_1_ms_(100.00%)_Space_40.6_MB_(100.00%)
 
 import kotlin.math.min
 
@@ -15,7 +15,7 @@ class Solution {
                 time = diff
                 ans = event[0]
             } else if (diff == time) {
-                ans = min(ans.toDouble(), event[0].toDouble()).toInt()
+                ans = min(ans, event[0])
             }
             last = event[1]
         }

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

@@ -1,6 +1,6 @@
 package g3301_3400.s3387_maximize_amount_after_two_days_of_conversions
 
-// #Medium #2024_12_15_Time_7_ms_(100.00%)_Space_46.6_MB_(100.00%)
+// #Medium #2024_12_15_Time_13_ms_(100.00%)_Space_43.7_MB_(100.00%)
 
 import kotlin.math.max
 

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

@@ -1,28 +1,28 @@
 package g3301_3400.s3388_count_beautiful_splits_in_an_array
 
-// #Medium #2024_12_15_Time_165_ms_(100.00%)_Space_266.1_MB_(100.00%)
+// #Medium #2024_12_15_Time_162_ms_(100.00%)_Space_235.2_MB_(100.00%)
 
 import kotlin.math.min
 
 class Solution {
     fun beautifulSplits(nums: IntArray): Int {
         val n = nums.size
-        val lcp = Array<IntArray?>(n + 1) { IntArray(n + 1) }
+        val lcp = Array<IntArray>(n + 1) { IntArray(n + 1) }
         for (i in n - 1 downTo 0) {
             for (j in n - 1 downTo 0) {
                 if (nums[i] == nums[j]) {
-                    lcp[i]!![j] = 1 + lcp[i + 1]!![j + 1]
+                    lcp[i][j] = 1 + lcp[i + 1][j + 1]
                 } else {
-                    lcp[i]!![j] = 0
+                    lcp[i][j] = 0
                 }
             }
         }
         var res = 0
         for (i in 0..<n) {
             for (j in i + 1..<n) {
                 if (i > 0) {
-                    val lcp1 = min(min(lcp[0]!![i], i), (j - i))
-                    val lcp2 = min(min(lcp[i]!![j], (j - i)), (n - j))
+                    val lcp1 = min(min(lcp[0][i], i), (j - i))
+                    val lcp2 = min(min(lcp[i][j], (j - i)), (n - j))
                     if (lcp1 >= i || lcp2 >= j - i) {
                         ++res
                     }

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

@@ -1,6 +1,6 @@
 package g3301_3400.s3389_minimum_operations_to_make_character_frequencies_equal
 
-// #Hard #2024_12_15_Time_56_ms_(100.00%)_Space_44.8_MB_(100.00%)
+// #Hard #2024_12_15_Time_88_ms_(100.00%)_Space_40.7_MB_(100.00%)
 
 import kotlin.math.max
 import kotlin.math.min