動機

都是從原點出發

Problem

You are given an m x n matrix M initialized with all 0's and an array of operations ops, where ops[i] = [ai, bi] means M[x][y] should be incremented by one for all 0 <= x < ai and 0 <= y < bi.

Count and return the number of maximum integers in the matrix after performing all the operations.

 

Example 1:

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

Example 2:

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

Example 3:

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

 

Constraints:

  • 1 <= m, n <= 4 * 104
  • 0 <= ops.length <= 104
  • ops[i].length == 2
  • 1 <= ai <= m
  • 1 <= bi <= n

Sol

所以直接找x與y的最小

class Solution:
    def maxCount(self, m: int, n: int, ops: List[List[int]]) -> int:
        ops = set(tuple(op) for op in ops)
        if not ops:
            return m*n
        else:
            a = b = float('inf')
            for x,y in ops:
                a = min(a, x)
                b = min(b, y)
            return a*b