Improved task 3729

javadev · web-flow · commit 2a4625a09c3e · 2025-10-29T10:04:53.000+02:00
diff --git a/src/main/kotlin/g3701_3800/s3729_count_distinct_subarrays_divisible_by_k_in_sorted_array/Solution.kt b/src/main/kotlin/g3701_3800/s3729_count_distinct_subarrays_divisible_by_k_in_sorted_array/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
             if (i > 0 && x != nums[i - 1]) {
                 var s = sum
                 for (t in i - lastStart downTo 1) {
-                    cnt.merge((s % k).toInt(), 1) { a: Int?, b: Int? -> Integer.sum(a!!, b!!) }
+                    cnt.merge((s % k).toInt(), 1) { a: Int, b: Int -> Integer.sum(a, b) }
                     s -= nums[i - 1].toLong()
                 }
                 lastStart = i

Original file line number	Diff line number	Diff line change
`@@ -15,7 +15,7 @@ class Solution {`
`15`	`15`	`if (i > 0 && x != nums[i - 1]) {`
`16`	`16`	`var s = sum`
`17`	`17`	`for (t in i - lastStart downTo 1) {`
`18`		`- cnt.merge((s % k).toInt(), 1) { a: Int?, b: Int? -> Integer.sum(a!!, b!!) }`
	`18`	`+ cnt.merge((s % k).toInt(), 1) { a: Int, b: Int -> Integer.sum(a, b) }`
`19`	`19`	`s -= nums[i - 1].toLong()`
`20`	`20`	`}`
`21`	`21`	`lastStart = i`