Improved tasks 3574, 3575

Author: javadev

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

@@ -12,40 +12,40 @@ class Solution {
             mx = max(mx, x)
         }
         val width = 32 - Integer.numberOfLeadingZeros(mx)
-        val lowbitPos: Array<MutableList<Int>> = Array<MutableList<Int>>(width) { i: Int -> ArrayList<Int>() }
-        val intervals = Array<IntArray?>(width + 1) { IntArray(3) }
+        val lowBitPos: Array<MutableList<Int>> = Array<MutableList<Int>>(width) { i: Int -> ArrayList<Int>() }
+        val intervals = Array<IntArray>(width + 1) { IntArray(3) }
         var size = 0
         var ans: Long = 0
         for (i in nums.indices) {
             val x = nums[i]
             val tz = Integer.numberOfTrailingZeros(x)
-            lowbitPos[tz].add(i)
+            lowBitPos[tz].add(i)
             for (j in 0..<size) {
-                intervals[j]!![0] = gcd(intervals[j]!![0], x)
+                intervals[j][0] = gcd(intervals[j][0], x)
             }
-            intervals[size]!![0] = x
-            intervals[size]!![1] = i - 1
-            intervals[size]!![2] = i
+            intervals[size][0] = x
+            intervals[size][1] = i - 1
+            intervals[size][2] = i
             size++
             var idx = 1
             for (j in 1..<size) {
-                if (intervals[j]!![0] != intervals[j - 1]!![0]) {
-                    intervals[idx]!![0] = intervals[j]!![0]
-                    intervals[idx]!![1] = intervals[j]!![1]
-                    intervals[idx]!![2] = intervals[j]!![2]
+                if (intervals[j][0] != intervals[j - 1][0]) {
+                    intervals[idx][0] = intervals[j][0]
+                    intervals[idx][1] = intervals[j][1]
+                    intervals[idx][2] = intervals[j][2]
                     idx++
                 } else {
-                    intervals[idx - 1]!![2] = intervals[j]!![2]
+                    intervals[idx - 1][2] = intervals[j][2]
                 }
             }
             size = idx
             for (j in 0..<size) {
-                val g = intervals[j]!![0]
-                val l = intervals[j]!![1]
-                val r = intervals[j]!![2]
+                val g = intervals[j][0]
+                val l = intervals[j][1]
+                val r = intervals[j][2]
                 ans = max(ans, g.toLong() * (i - l))
-                val pos = lowbitPos[Integer.numberOfTrailingZeros(g)]
-                val minL = if (pos.size > k) max(l, pos.get(pos.size - k - 1)!!) else l
+                val pos = lowBitPos[Integer.numberOfTrailingZeros(g)]
+                val minL = if (pos.size > k) max(l, pos[pos.size - k - 1]) else l
                 if (minL < r) {
                     ans = max(ans, g.toLong() * 2 * (i - minL))
                 }

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

@@ -38,7 +38,6 @@ class Solution {
             isOk[i] = valid
         }
         tree = Array(n) { initialCapacity: Int -> ArrayList(initialCapacity) }
-        Arrays.setAll<MutableList<out Any?>?>(tree, IntFunction { initialCapacity: Int -> ArrayList(initialCapacity) })
         val root = 0
         for (i in 1..<n) {
             tree[par[i]].add(i)
@@ -49,7 +48,7 @@ class Solution {
 
     private fun dfs(u: Int): LongArray {
         var dp = LongArray(full)
-        Arrays.fill(dp, neg)
+        dp.fill(neg)
         dp[0] = 0
         if (isOk[u]) {
             dp[mask[u]] = `val`[u].toLong()