Range Addition II Python Solution with Tests

lcpy gen -n 598   # by problem number
lcpy gen -s range_addition_ii   # by problem name

Input: m = 3, n = 3, ops = [[2,2],[3,3]]
Output: 4
Explanation: The maximum integer in M is 2, and there are four of it in M. So return 4.

Input: m = 3, n = 3, ops = [[2,2],[3,3],[3,3],[3,3],[2,2],[3,3],[3,3],[3,3],[2,2],[3,3],[3,3],[3,3]]
Output: 4

Input: m = 3, n = 3, ops = []
Output: 9

class Solution:
    # Time: O(len(ops))
    # Space: O(1)
    def max_count(self, m: int, n: int, ops: list[list[int]]) -> int:
        if not ops:
            return m * n
        min_a = min(op[0] for op in ops)
        min_b = min(op[1] for op in ops)
        return min_a * min_b