| https://leetcode.com/problems/range-addition-ii/ | Easy |
|---|
class Solution {
fun maxCount(m: Int, n: Int, ops: Array<IntArray>): Int {
var minRow = m
var minCol = n
for (op in ops) {
minRow = minOf(minRow, op[0])
minCol = minOf(minCol, op[1])
}
return minRow * minCol
}
}