leetcode 598 Range Addition II 范围求和 II python 最简一行代码

class Solution:
    def maxCount(self, m, n, ops):
        """
        :type m: int
        :type n: int
        :type ops: List[List[int]]
        :rtype: int
        """
        # 考虑特殊情况，ops为空
        return min(i[0] for i in ops) * min(i[1] for i in ops)  if ops else m*n