diff --git a/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt b/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt index 90176b972..3be9aba5b 100644 --- a/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0770_basic_calculator_iv/Solution.kt @@ -48,7 +48,7 @@ class Solution { return ans } - fun evaluate(vars: Map): Node { + fun evaluate(vars: Map): Node { val ans = Node() for (cur in mem.keys) { var cnt = mem[cur]!! @@ -137,14 +137,14 @@ class Solution { return a.sub(b) } - fun basicCalculatorIV(expression: String?, evalvarS: Array?, evalintS: IntArray?): List { + fun basicCalculatorIV(expression: String, evalvars: Array, evalints: IntArray): List { val ans: List = ArrayList() - if (expression.isNullOrEmpty() || evalvarS == null || evalintS == null) { + if (expression.isEmpty()) { return ans } - val vars: MutableMap = HashMap() - for (i in evalvarS.indices) { - vars[evalvarS[i]] = evalintS[i] + val vars: MutableMap = HashMap() + for (i in evalvars.indices) { + vars[evalvars[i]] = evalints[i] } val n = expression.length val numS = ArrayDeque() diff --git a/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt b/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt index 3c542b072..a57092c0c 100644 --- a/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt +++ b/src/main/kotlin/g1801_1900/s1825_finding_mk_average/MKAverage.kt @@ -36,12 +36,12 @@ class MKAverage(private val capacity: Int, private val boundary: Int) { val count = nums[num] if (skipCount < 0) { sum += num * min(count, numsCount) - numsCount = (numsCount - min(count, numsCount)).toInt() + numsCount = numsCount - min(count, numsCount) } else { skipCount -= count if (skipCount < 0) { sum += num * min(abs(skipCount), numsCount) - numsCount = (numsCount - min(abs(skipCount), numsCount)).toInt() + numsCount = numsCount - min(abs(skipCount), numsCount) } } if (numsCount == 0) { diff --git a/src/main/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.kt b/src/main/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.kt index d409ca1a1..13e63ce9b 100644 --- a/src/main/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.kt +++ b/src/main/kotlin/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes/Solution.kt @@ -67,7 +67,6 @@ class Solution { 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() pq = PriorityQueue { x: Int, y: Int -> y - x } pq.add(a) pq.add(b) diff --git a/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt b/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt index c3fcc7dd6..fc48831a3 100644 --- a/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt +++ b/src/main/kotlin/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.kt @@ -24,10 +24,9 @@ class Solution { } var ans: Long = 0 val s = LongArray(one + 1) - val n = (min(zero, one) + 1).toInt() + val n = min(zero, one) + 1 for ( groups0 in (zero + limit - 1) / limit..min(zero, n) - .toInt() ) { val s0 = calc(groups0, zero, limit) for ( diff --git a/src/main/kotlin/g3401_3500/s3429_paint_house_iv/Solution.kt b/src/main/kotlin/g3401_3500/s3429_paint_house_iv/Solution.kt index 4a047d9d6..d7651b3df 100644 --- a/src/main/kotlin/g3401_3500/s3429_paint_house_iv/Solution.kt +++ b/src/main/kotlin/g3401_3500/s3429_paint_house_iv/Solution.kt @@ -34,7 +34,7 @@ class Solution { } var ans = Long.Companion.MAX_VALUE for (x in longArrayOf(dp0, dp1, dp2, dp3, dp4, dp5)) { - ans = min(ans, x).toLong() + ans = min(ans, x) } return ans } diff --git a/src/main/kotlin/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.kt b/src/main/kotlin/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.kt index aa67822f6..4f14e025e 100644 --- a/src/main/kotlin/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.kt +++ b/src/main/kotlin/g3401_3500/s3468_find_the_number_of_copy_arrays/Solution.kt @@ -14,7 +14,7 @@ class Solution { val diff = original[i] - original[i - 1] low = max((low + diff), bounds[i][0]) high = min((high + diff), bounds[i][1]) - ans = min(ans, (high - low + 1)).toInt() + ans = min(ans, high - low + 1) } return max(ans, 0) } diff --git a/src/main/kotlin/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.kt b/src/main/kotlin/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.kt index 4da3400a3..96f058e07 100644 --- a/src/main/kotlin/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.kt +++ b/src/main/kotlin/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.kt @@ -32,7 +32,7 @@ class Solution { f[n + 1] = n + 1 f[n] = h[n] for (i in n - 1 downTo 1) { - f[i] = min(h[i], f[i + 1]).toInt() + f[i] = min(h[i], f[i + 1]) } // forbiddenCount(x) returns (n - x + 1) if x <= n, else 0. // This is the number of forbidden subarrays starting at some i when f[i] = x. @@ -53,7 +53,7 @@ class Solution { continue } // Simulate removal: new candidate at j becomes d2[j] - val newCandidate = if (j < n) min(d2[j], f[j + 1]).toInt() else d2[j] + val newCandidate = if (j < n) min(d2[j], f[j + 1]) else d2[j] // We'll recompute the new f values for indices 1..j. // Let newF[i] denote the updated value. // For i > j, newF[i] remains as original f[i].