g2401_2500.s2439_minimize_maximum_of_array.Solution.kt Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation

Kotlin-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.28

package g2401_2500.s2439_minimize_maximum_of_array

// #Medium #Array #Dynamic_Programming #Greedy #Binary_Search #Prefix_Sum
// #2023_07_05_Time_508_ms_(100.00%)_Space_61.5_MB_(50.00%)

class Solution {
    fun minimizeArrayValue(nums: IntArray): Int {
        var max: Long = 0
        var sum: Long = 0
        for (i in nums.indices) {
            sum += nums[i].toLong()
            max = Math.max(max, (sum + i) / (i + 1))
        }
        return max.toInt()
    }
}