Improved min and max

javadev · web-flow · commit fa8f3844f5e9 · 2025-04-12T19:52:51.000+03:00
diff --git a/src/main/kotlin/g2801_2900/s2865_beautiful_towers_i/Solution.kt b/src/main/kotlin/g2801_2900/s2865_beautiful_towers_i/Solution.kt
@@ -10,12 +10,12 @@ class Solution {
         var ans = maxHeights[pickId].toLong()
         var min = maxHeights[pickId].toLong()
         for (i in pickId - 1 downTo 0) {
-            min = min(min.toDouble(), maxHeights[i].toDouble()).toLong()
+            min = min(min, maxHeights[i].toLong())
             ans += min
         }
         min = maxHeights[pickId].toLong()
         for (i in pickId + 1 until maxHeights.size) {
-            min = min(min.toDouble(), maxHeights[i].toDouble()).toLong()
+            min = min(min, maxHeights[i].toLong())
             ans += min
         }
         return ans
@@ -30,7 +30,7 @@ class Solution {
                         maxHeights[i] >= maxHeights[i + 1]
                     )
             ) {
-                ans = max(ans.toDouble(), `fun`(maxHeights, i).toDouble()).toLong()
+                ans = max(ans, `fun`(maxHeights, i))
             }
         }
         return ans
diff --git a/src/main/kotlin/g2801_2900/s2874_maximum_value_of_an_ordered_triplet_ii/Solution.kt b/src/main/kotlin/g2801_2900/s2874_maximum_value_of_an_ordered_triplet_ii/Solution.kt
@@ -10,14 +10,14 @@ class Solution {
         var tempMax = nums[0]
         for (i in 1 until diff.size - 1) {
             diff[i] = tempMax - nums[i]
-            tempMax = max(tempMax.toDouble(), nums[i].toDouble()).toInt()
+            tempMax = max(tempMax, nums[i])
         }
         var max = Long.MIN_VALUE
         tempMax = nums[nums.size - 1]
         for (i in nums.size - 2 downTo 1) {
-            max = max(max.toDouble(), (tempMax.toLong() * diff[i]).toDouble()).toLong()
-            tempMax = max(tempMax.toDouble(), nums[i].toDouble()).toInt()
+            max = max(max, tempMax.toLong() * diff[i])
+            tempMax = max(tempMax, nums[i])
         }
-        return max(max.toDouble(), 0.0).toLong()
+        return max(max, 0)
     }
 }
diff --git a/src/main/kotlin/g2801_2900/s2896_apply_operations_to_make_two_strings_equal/Solution.kt b/src/main/kotlin/g2801_2900/s2896_apply_operations_to_make_two_strings_equal/Solution.kt
@@ -21,14 +21,12 @@ class Solution {
         }
         val dp = IntArray(m)
         dp[0] = 0
-        dp[1] = min(x.toDouble(), (diffs[1] - diffs[0]).toDouble()).toInt()
+        dp[1] = min(x, diffs[1] - diffs[0])
         for (i in 2 until m) {
             if ((i and 1) == 1) {
-                dp[i] = min((dp[i - 1] + x).toDouble(), (dp[i - 2] + diffs[i] - diffs[i - 1]).toDouble())
-                    .toInt()
+                dp[i] = min(dp[i - 1] + x, dp[i - 2] + diffs[i] - diffs[i - 1])
             } else {
-                dp[i] = min(dp[i - 1].toDouble(), (dp[i - 2] + diffs[i] - diffs[i - 1]).toDouble())
-                    .toInt()
+                dp[i] = min(dp[i - 1], dp[i - 2] + diffs[i] - diffs[i - 1])
             }
         }
         return dp[m - 1]
diff --git a/src/main/kotlin/g2901_3000/s2908_minimum_sum_of_mountain_triplets_i/Solution.kt b/src/main/kotlin/g2901_3000/s2908_minimum_sum_of_mountain_triplets_i/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
                 for (k in j + 1 until nums.size) {
                     if (nums[i] < nums[j] && nums[k] < nums[j]) {
                         val min = nums[i] + nums[k] + nums[j]
-                        output = min(min.toDouble(), output.toDouble()).toInt()
+                        output = min(min, output)
                     }
                 }
             }
diff --git a/src/main/kotlin/g2901_3000/s2909_minimum_sum_of_mountain_triplets_ii/Solution.kt b/src/main/kotlin/g2901_3000/s2909_minimum_sum_of_mountain_triplets_ii/Solution.kt
@@ -32,8 +32,7 @@ class Solution {
         var ans = Int.MAX_VALUE
         for (i in 0 until n) {
             if (leftSmallest[i] != -1 && rightSmallest[i] != -1) {
-                ans = min(ans.toDouble(), (leftSmallest[i] + rightSmallest[i] + nums[i]).toDouble())
-                    .toInt()
+                ans = min(ans, leftSmallest[i] + rightSmallest[i] + nums[i])
             }
         }
         if (ans == Int.MAX_VALUE) {
diff --git a/src/main/kotlin/g2901_3000/s2911_minimum_changes_to_make_k_semi_palindromes/Solution.kt b/src/main/kotlin/g2901_3000/s2911_minimum_changes_to_make_k_semi_palindromes/Solution.kt
@@ -28,7 +28,7 @@ class Solution {
         }
         var min = INF
         for (j in (k - 1) * 2 until (i - 1)) {
-            min = min(min.toDouble(), (calc(j, k - 1) + change(j, i)).toDouble()).toInt()
+            min = min(min, calc(j, k - 1) + change(j, i))
         }
         dp[i][k] = min
         return min
diff --git a/src/main/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/Solution.kt b/src/main/kotlin/g2901_3000/s2926_maximum_balanced_subsequence_sum/Solution.kt
@@ -68,7 +68,7 @@ class Solution {
             var index = index
             var result: Long = 0
             while (index > 0) {
-                result = max(tree[index].toDouble(), result.toDouble()).toLong()
+                result = max(tree[index], result)
                 index -= lowbit(index)
             }
             return result
diff --git a/src/main/kotlin/g2901_3000/s2944_minimum_number_of_coins_for_fruits/Solution.kt b/src/main/kotlin/g2901_3000/s2944_minimum_number_of_coins_for_fruits/Solution.kt
@@ -16,7 +16,7 @@ class Solution {
             if (acquired + 1 < n) {
                 var min = Int.MAX_VALUE
                 for (j in acquired + 1 downTo i + 1) {
-                    min = min(min.toDouble(), dp[j].toDouble()).toInt()
+                    min = min(min, dp[j])
                 }
                 dp[i] = prices[i] + min
             } else {
diff --git a/src/main/kotlin/g2901_3000/s2954_count_the_number_of_infection_sequences/Solution.kt b/src/main/kotlin/g2901_3000/s2954_count_the_number_of_infection_sequences/Solution.kt
@@ -40,7 +40,7 @@ class Solution {
         var res: Long = 1
         for (i in 1 until sick.size) {
             val group = sick[i] - sick[i - 1] - 1
-            res = res * modPow(2, max(0.0, (group - 1).toDouble()).toInt(), MOD) % MOD
+            res = res * modPow(2, max(0, group - 1), MOD) % MOD
             res = res * binomCoeff(sick[i] - i, group) % MOD
         }
         return (res * binomCoeff(n - sick.size, n - sick[sick.size - 1] - 1) % MOD).toInt()
diff --git a/src/main/kotlin/g2901_3000/s2958_length_of_longest_subarray_with_at_most_k_frequency/Solution.kt b/src/main/kotlin/g2901_3000/s2958_length_of_longest_subarray_with_at_most_k_frequency/Solution.kt
@@ -10,8 +10,8 @@ class Solution {
         var m1 = Int.MIN_VALUE
         var m2 = Int.MAX_VALUE
         for (num in nums) {
-            m1 = max(m1.toDouble(), num.toDouble()).toInt()
-            m2 = min(m2.toDouble(), num.toDouble()).toInt()
+            m1 = max(m1, num)
+            m2 = min(m2, num)
         }
         var max = 0
         val f = IntArray(m1 - m2 + 1)
diff --git a/src/main/kotlin/g3001_3100/s3039_apply_operations_to_make_string_empty/Solution.kt b/src/main/kotlin/g3001_3100/s3039_apply_operations_to_make_string_empty/Solution.kt
@@ -14,7 +14,7 @@ class Solution {
         val sb = StringBuilder()
         for (c in ar) {
             freq[c.code - 'a'.code]++
-            max = max(freq[c.code - 'a'.code].toDouble(), max.toDouble()).toInt()
+            max = max(freq[c.code - 'a'.code], max)
         }
         for (i in n - 1 downTo 0) {
             if (freq[ar[i].code - 'a'.code] == max) {
diff --git a/src/main/kotlin/g3001_3100/s3074_apple_redistribution_into_boxes/Solution.kt b/src/main/kotlin/g3001_3100/s3074_apple_redistribution_into_boxes/Solution.kt
@@ -15,7 +15,7 @@ class Solution {
         var max = 0
         for (j in capacity) {
             count[j]++
-            max = max(max.toDouble(), j.toDouble()).toInt()
+            max = max(max, j)
         }
         for (i in max downTo 0) {
             if (count[i] >= 1) {
diff --git a/src/main/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/Solution.kt b/src/main/kotlin/g3001_3100/s3076_shortest_uncommon_substring_in_an_array/Solution.kt
@@ -28,8 +28,7 @@ class Solution {
                 val curLen = search(
                     cs,
                     i,
-                    min(m.toDouble(), (i + resultLen).toDouble())
-                        .toInt(),
+                    min(m, (i + resultLen)),
                     k,
                 )
                 if (curLen != -1) {
diff --git a/src/main/kotlin/g3001_3100/s3086_minimum_moves_to_pick_k_ones/Solution.kt b/src/main/kotlin/g3001_3100/s3086_minimum_moves_to_pick_k_ones/Solution.kt
@@ -53,7 +53,7 @@ class Solution {
             val area1 = (mid - l + 1).toLong() * median
             val area2 = (r - mid).toLong() * median
             val curRes = area1 - sum1 + sum2 - area2
-            res = min(res.toDouble(), curRes.toDouble()).toLong()
+            res = min(res, curRes)
             l++
         }
         res += 2L * maxChanges
diff --git a/src/main/kotlin/g3001_3100/s3092_most_frequent_ids/Solution.kt b/src/main/kotlin/g3001_3100/s3092_most_frequent_ids/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
         var max = Int.MIN_VALUE
         val n = nums.size
         for (num in nums) {
-            max = max(max.toDouble(), num.toDouble()).toInt()
+            max = max(max, num)
         }
         val bins = LongArray(max + 1)
         var mostFrequentID = 0
diff --git a/src/main/kotlin/g3101_3200/s3121_count_the_number_of_special_characters_ii/Solution.kt b/src/main/kotlin/g3101_3200/s3121_count_the_number_of_special_characters_ii/Solution.kt
@@ -14,7 +14,7 @@ class Solution {
         for (i in word.indices) {
             val a = word[i]
             if (a.code < 91) {
-                capital[a.code - 65] = min(capital[a.code - 65].toDouble(), i.toDouble()).toInt()
+                capital[a.code - 65] = min(capital[a.code - 65], i)
             } else {
                 small[a.code - 97] = i
             }
diff --git a/src/main/kotlin/g3101_3200/s3161_block_placement_queries/Solution.kt b/src/main/kotlin/g3101_3200/s3161_block_placement_queries/Solution.kt
@@ -70,7 +70,7 @@ class Solution {
                 right.parent[x] = next
                 bit.update(next, next - pre)
             } else {
-                val maxGap = max(bit.query(pre).toDouble(), (x - pre).toDouble()).toInt()
+                val maxGap = max(bit.query(pre), x - pre)
                 ans[index--] = maxGap >= q[2]
             }
         }
@@ -83,7 +83,7 @@ class Solution {
         fun update(i: Int, v: Int) {
             var i = i
             while (i < n) {
-                tree[i] = max(tree[i].toDouble(), v.toDouble()).toInt()
+                tree[i] = max(tree[i], v)
                 i += i and -i
             }
         }
@@ -92,7 +92,7 @@ class Solution {
             var i = i
             var result = 0
             while (i > 0) {
-                result = max(result.toDouble(), tree[i].toDouble()).toInt()
+                result = max(result, tree[i])
                 i = i and i - 1
             }
             return result
diff --git a/src/main/kotlin/g3101_3200/s3196_maximize_total_cost_of_alternating_subarrays/Solution.kt b/src/main/kotlin/g3101_3200/s3196_maximize_total_cost_of_alternating_subarrays/Solution.kt
@@ -10,7 +10,7 @@ class Solution {
         var addResult = nums[0].toLong()
         var subResult = nums[0].toLong()
         for (i in 1 until n) {
-            val tempAdd = (max(addResult.toDouble(), subResult.toDouble()) + nums[i]).toLong()
+            val tempAdd = max(addResult, subResult) + nums[i]
             val tempSub = addResult - nums[i]
             addResult = tempAdd
             subResult = tempSub
diff --git a/src/main/kotlin/g3201_3300/s3207_maximum_points_after_enemy_battles/Solution.kt b/src/main/kotlin/g3201_3300/s3207_maximum_points_after_enemy_battles/Solution.kt
@@ -9,7 +9,7 @@ class Solution {
         val n = enemyEnergies.size
         var min = enemyEnergies[0]
         for (i in 1 until n) {
-            min = min(min.toDouble(), enemyEnergies[i].toDouble()).toInt()
+            min = min(min, enemyEnergies[i])
         }
         if (currentEnergy == 0 || currentEnergy < min) {
             return 0
diff --git a/src/main/kotlin/g3201_3300/s3272_find_the_count_of_good_integers/Solution.kt b/src/main/kotlin/g3201_3300/s3272_find_the_count_of_good_integers/Solution.kt
@@ -73,7 +73,7 @@ class Solution {
 
     private fun allKPalindromes(n: Int, k: Int): List<String> {
         val ans = StringBuilder(n)
-        ans.append("0".repeat(max(0.0, n.toDouble()).toInt()))
+        ans.append("0".repeat(max(0, n)))
         val rem = IntArray(n)
         rem[0] = 1
         for (i in 1 until n) {
diff --git a/src/main/kotlin/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/Solution.kt b/src/main/kotlin/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/Solution.kt
@@ -66,7 +66,7 @@ class Solution {
         for (i in 2..<m - 2) {
             var len = 0
             if (i < right) {
-                len = min(lens[2 * center - i].toDouble(), (right - i).toDouble()).toInt()
+                len = min(lens[2 * center - i], right - i)
             }
             while (t[i + len + 1] == t[i - len - 1]) {
                 len++
diff --git a/src/main/kotlin/g3301_3400/s3372_maximize_the_number_of_target_nodes_after_connecting_trees_i/Solution.kt b/src/main/kotlin/g3301_3400/s3372_maximize_the_number_of_target_nodes_after_connecting_trees_i/Solution.kt
@@ -82,7 +82,7 @@ class Solution {
         run {
             var i = 0
             while (k != 0 && i < m) {
-                max = max(max.toDouble(), b[i][k - 1].toDouble()).toInt()
+                max = max(max, b[i][k - 1])
                 i++
             }
         }
diff --git a/src/main/kotlin/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.kt b/src/main/kotlin/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections/Solution.kt
@@ -32,12 +32,12 @@ class Solution {
             if (start >= max && ++cut == 2) {
                 return true
             }
-            max = max(max.toDouble(), (arr[i] and MASK.toLong()).toInt().toDouble()).toInt()
+            max = max(max, (arr[i] and MASK.toLong()).toInt())
         }
         return false
     }
 
     companion object {
-        private val MASK = (1 shl 30) - 1
+        private const val MASK = (1 shl 30) - 1
     }
 }
diff --git a/src/main/kotlin/g3401_3500/s3411_maximum_subarray_with_equal_products/Solution.kt b/src/main/kotlin/g3401_3500/s3411_maximum_subarray_with_equal_products/Solution.kt
@@ -26,7 +26,7 @@ class Solution {
                 currGCD = gcd(currGCD, nums[j])
                 currLCM = lcm(currLCM, nums[j])
                 if (currPro == currLCM * currGCD) {
-                    maxL = max(maxL.toDouble(), (j - i + 1).toDouble()).toInt()
+                    maxL = max(maxL, j - i + 1)
                 }
             }
         }
diff --git a/src/main/kotlin/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.kt b/src/main/kotlin/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags/Solution.kt
@@ -7,31 +7,31 @@ import kotlin.math.max
 
 class Solution {
     fun maximumCoins(coins: Array<IntArray>, k: Int): Long {
-        coins.sortWith { a: IntArray?, b: IntArray? -> a!![0] - b!![0] }
+        coins.sortWith { a: IntArray, b: IntArray -> a[0] - b[0] }
         val n = coins.size
         var res: Long = 0
         var cur: Long = 0
         var j = 0
         for (ints in coins) {
             while (j < n && coins[j][1] <= ints[0] + k - 1) {
-                cur += (coins[j][1] - coins[j][0] + 1).toLong() * coins[j][2]
+                cur += (coins[j][1] - coins[j][0] + 1) * coins[j][2]
                 j++
             }
             if (j < n) {
-                val part = max(0.0, (ints[0] + k - 1 - coins[j][0] + 1).toDouble()).toLong() * coins[j][2]
-                res = max(res.toDouble(), (cur + part).toDouble()).toLong()
+                val part = max(0, ints[0] + k - 1 - coins[j][0] + 1) * coins[j][2]
+                res = max(res, cur + part)
             }
-            cur -= (ints[1] - ints[0] + 1).toLong() * ints[2]
+            cur -= (ints[1] - ints[0] + 1) * ints[2]
         }
         cur = 0
         j = 0
         for (coin in coins) {
-            cur += (coin[1] - coin[0] + 1).toLong() * coin[2]
+            cur += (coin[1] - coin[0] + 1) * coin[2]
             while (coins[j][1] < coin[1] - k + 1) {
-                cur -= (coins[j][1] - coins[j][0] + 1).toLong() * coins[j][2]
+                cur -= (coins[j][1] - coins[j][0] + 1) * coins[j][2]
                 j++
             }
-            val part = max(0.0, (coin[1] - k - coins[j][0] + 1).toDouble()).toLong() * coins[j][2]
+            val part = max(0, coin[1] - k - coins[j][0] + 1) * coins[j][2]
             res = max(res, (cur - part))
         }
         return res
diff --git a/src/main/kotlin/g3401_3500/s3459_length_of_longest_v_shaped_diagonal_segment/Solution.kt b/src/main/kotlin/g3401_3500/s3459_length_of_longest_v_shaped_diagonal_segment/Solution.kt
@@ -31,7 +31,7 @@ class Solution {
             for (j in 0..<m) {
                 if (g[i][j] == 1) {
                     for (d in 0..3) {
-                        res = max(res.toDouble(), dp(i, j, 1, d, 1).toDouble()).toInt()
+                        res = max(res, dp(i, j, 1, d, 1))
                     }
                 }
             }
diff --git a/src/main/kotlin/g3401_3500/s3479_fruits_into_baskets_iii/Solution.kt b/src/main/kotlin/g3401_3500/s3479_fruits_into_baskets_iii/Solution.kt
@@ -20,7 +20,7 @@ class Solution {
             seg[size + i] = 0
         }
         for (i in size - 1 downTo 1) {
-            seg[i] = max(seg[i shl 1].toDouble(), seg[i shl 1 or 1].toDouble()).toInt()
+            seg[i] = max(seg[i shl 1], seg[i shl 1 or 1])
         }
         var ans = 0
         for (f in fruits) {
@@ -46,7 +46,7 @@ class Solution {
         seg[i] = `val`
         i /= 2
         while (i > 0) {
-            seg[i] = max(seg[i shl 1].toDouble(), seg[i shl 1 or 1].toDouble()).toInt()
+            seg[i] = max(seg[i shl 1], seg[i shl 1 or 1])
             i /= 2
         }
     }
diff --git a/src/main/kotlin/g3501_3600/s3508_implement_router/Router.kt b/src/main/kotlin/g3501_3600/s3508_implement_router/Router.kt
@@ -51,7 +51,7 @@ class Router(private val size: Int) {
         return true
     }
 
-    fun forwardPacket(): IntArray? {
+    fun forwardPacket(): IntArray {
         if (q.isEmpty()) {
             return intArrayOf()
         }
@@ -85,7 +85,7 @@ class Router(private val size: Int) {
             if (lower == -1 || higher == -1) {
                 0
             } else {
-                max(0.0, (higher - lower + 1).toDouble()).toInt()
+                max(0, higher - lower + 1)
             }
         } else {
             0

Original file line number	Diff line number	Diff line change
`@@ -10,12 +10,12 @@ class Solution {`
`10`	`10`	`var ans = maxHeights[pickId].toLong()`
`11`	`11`	`var min = maxHeights[pickId].toLong()`
`12`	`12`	`for (i in pickId - 1 downTo 0) {`
`13`		`- min = min(min.toDouble(), maxHeights[i].toDouble()).toLong()`
	`13`	`+ min = min(min, maxHeights[i].toLong())`
`14`	`14`	`ans += min`
`15`	`15`	`}`
`16`	`16`	`min = maxHeights[pickId].toLong()`
`17`	`17`	`for (i in pickId + 1 until maxHeights.size) {`
`18`		`- min = min(min.toDouble(), maxHeights[i].toDouble()).toLong()`
	`18`	`+ min = min(min, maxHeights[i].toLong())`
`19`	`19`	`ans += min`
`20`	`20`	`}`
`21`	`21`	`return ans`
`@@ -30,7 +30,7 @@ class Solution {`
`30`	`30`	`maxHeights[i] >= maxHeights[i + 1]`
`31`	`31`	`)`
`32`	`32`	`) {`
`33`		- ans = max(ans.toDouble(), `fun`(maxHeights, i).toDouble()).toLong()
	`33`	+ ans = max(ans, `fun`(maxHeights, i))
`34`	`34`	`}`
`35`	`35`	`}`
`36`	`36`	`return ans`
Original file line number	Diff line number	Diff line change
`@@ -10,14 +10,14 @@ class Solution {`
`10`	`10`	`var tempMax = nums[0]`
`11`	`11`	`for (i in 1 until diff.size - 1) {`
`12`	`12`	`diff[i] = tempMax - nums[i]`
`13`		`- tempMax = max(tempMax.toDouble(), nums[i].toDouble()).toInt()`
	`13`	`+ tempMax = max(tempMax, nums[i])`
`14`	`14`	`}`
`15`	`15`	`var max = Long.MIN_VALUE`
`16`	`16`	`tempMax = nums[nums.size - 1]`
`17`	`17`	`for (i in nums.size - 2 downTo 1) {`
`18`		`- max = max(max.toDouble(), (tempMax.toLong() * diff[i]).toDouble()).toLong()`
`19`		`- tempMax = max(tempMax.toDouble(), nums[i].toDouble()).toInt()`
	`18`	`+ max = max(max, tempMax.toLong() * diff[i])`
	`19`	`+ tempMax = max(tempMax, nums[i])`
`20`	`20`	`}`
`21`		`- return max(max.toDouble(), 0.0).toLong()`
	`21`	`+ return max(max, 0)`
`22`	`22`	`}`
`23`	`23`	`}`
Original file line number	Diff line number	Diff line change
`@@ -21,14 +21,12 @@ class Solution {`
`21`	`21`	`}`
`22`	`22`	`val dp = IntArray(m)`
`23`	`23`	`dp[0] = 0`
`24`		`- dp[1] = min(x.toDouble(), (diffs[1] - diffs[0]).toDouble()).toInt()`
	`24`	`+ dp[1] = min(x, diffs[1] - diffs[0])`
`25`	`25`	`for (i in 2 until m) {`
`26`	`26`	`if ((i and 1) == 1) {`
`27`		`- dp[i] = min((dp[i - 1] + x).toDouble(), (dp[i - 2] + diffs[i] - diffs[i - 1]).toDouble())`
`28`		`- .toInt()`
	`27`	`+ dp[i] = min(dp[i - 1] + x, dp[i - 2] + diffs[i] - diffs[i - 1])`
`29`	`28`	`} else {`
`30`		`- dp[i] = min(dp[i - 1].toDouble(), (dp[i - 2] + diffs[i] - diffs[i - 1]).toDouble())`
`31`		`- .toInt()`
	`29`	`+ dp[i] = min(dp[i - 1], dp[i - 2] + diffs[i] - diffs[i - 1])`
`32`	`30`	`}`
`33`	`31`	`}`
`34`	`32`	`return dp[m - 1]`
Original file line number	Diff line number	Diff line change
`@@ -15,7 +15,7 @@ class Solution {`
`15`	`15`	`for (k in j + 1 until nums.size) {`
`16`	`16`	`if (nums[i] < nums[j] && nums[k] < nums[j]) {`
`17`	`17`	`val min = nums[i] + nums[k] + nums[j]`
`18`		`- output = min(min.toDouble(), output.toDouble()).toInt()`
	`18`	`+ output = min(min, output)`
`19`	`19`	`}`
`20`	`20`	`}`
`21`	`21`	`}`
Original file line number	Diff line number	Diff line change
`@@ -32,8 +32,7 @@ class Solution {`
`32`	`32`	`var ans = Int.MAX_VALUE`
`33`	`33`	`for (i in 0 until n) {`
`34`	`34`	`if (leftSmallest[i] != -1 && rightSmallest[i] != -1) {`
`35`		`- ans = min(ans.toDouble(), (leftSmallest[i] + rightSmallest[i] + nums[i]).toDouble())`
`36`		`- .toInt()`
	`35`	`+ ans = min(ans, leftSmallest[i] + rightSmallest[i] + nums[i])`
`37`	`36`	`}`
`38`	`37`	`}`
`39`	`38`	`if (ans == Int.MAX_VALUE) {`
Original file line number	Diff line number	Diff line change
`@@ -28,7 +28,7 @@ class Solution {`
`28`	`28`	`}`
`29`	`29`	`var min = INF`
`30`	`30`	`for (j in (k - 1) * 2 until (i - 1)) {`
`31`		`- min = min(min.toDouble(), (calc(j, k - 1) + change(j, i)).toDouble()).toInt()`
	`31`	`+ min = min(min, calc(j, k - 1) + change(j, i))`
`32`	`32`	`}`
`33`	`33`	`dp[i][k] = min`
`34`	`34`	`return min`
Original file line number	Diff line number	Diff line change
`@@ -68,7 +68,7 @@ class Solution {`
`68`	`68`	`var index = index`
`69`	`69`	`var result: Long = 0`
`70`	`70`	`while (index > 0) {`
`71`		`- result = max(tree[index].toDouble(), result.toDouble()).toLong()`
	`71`	`+ result = max(tree[index], result)`
`72`	`72`	`index -= lowbit(index)`
`73`	`73`	`}`
`74`	`74`	`return result`
Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ class Solution {`
`16`	`16`	`if (acquired + 1 < n) {`
`17`	`17`	`var min = Int.MAX_VALUE`
`18`	`18`	`for (j in acquired + 1 downTo i + 1) {`
`19`		`- min = min(min.toDouble(), dp[j].toDouble()).toInt()`
	`19`	`+ min = min(min, dp[j])`
`20`	`20`	`}`
`21`	`21`	`dp[i] = prices[i] + min`
`22`	`22`	`} else {`
Original file line number	Diff line number	Diff line change
`@@ -40,7 +40,7 @@ class Solution {`
`40`	`40`	`var res: Long = 1`
`41`	`41`	`for (i in 1 until sick.size) {`
`42`	`42`	`val group = sick[i] - sick[i - 1] - 1`
`43`		`- res = res * modPow(2, max(0.0, (group - 1).toDouble()).toInt(), MOD) % MOD`
	`43`	`+ res = res * modPow(2, max(0, group - 1), MOD) % MOD`
`44`	`44`	`res = res * binomCoeff(sick[i] - i, group) % MOD`
`45`	`45`	`}`
`46`	`46`	`return (res * binomCoeff(n - sick.size, n - sick[sick.size - 1] - 1) % MOD).toInt()`