g0501_0600.s0598_range_addition_ii.Solution.kt Maven / Gradle / Ivy

Go to download

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.30

package g0501_0600.s0598_range_addition_ii

// #Easy #Array #Math #2023_02_02_Time_176_ms_(66.67%)_Space_35.4_MB_(100.00%)

class Solution {
    /*
     * Since the incrementing starts from zero to op[0] and op[1], we only need to find the range that
     * has the most overlaps. Thus we keep finding the minimum of both x and y.
     */
    fun maxCount(m: Int, n: Int, ops: Array): Int {
        var x = m
        var y = n
        for (op in ops) {
            x = x.coerceAtMost(op[0])
            y = y.coerceAtMost(op[1])
        }
        return x * y
    }
}