Python easy understand 1-linear solution


  • 0
    def maxCount(self, m, n, ops):
            return min(op[0] for op in ops) * min(op[1] for op in ops) if ops else m * n

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.