leetcode Range Addition II 范围相加

Given an m * n matrix M initialized with all 0’s and several update operations.

Operations are represented by a 2D array, and each operation is represented by an array with two positive integers a and b, which means M[i][j] should be added by one for all 0 <= i < a and 0 <= j < b.

You need to count and return the number of maximum integers in the matrix after performing all the operations.

Example 1:

• Input:

m = 3, n = 3
operations = [[2,2],[3,3]]

• Output: 4
• Explanation:

Initially, M =
[[0, 0, 0],
[0, 0, 0],
[0, 0, 0]]

After performing [2,2], M =
[[1, 1, 0],
[1, 1, 0],
[0, 0, 0]]

After performing [3,3], M =
[[2, 2, 1],
[2, 2, 1],
[1, 1, 1]]

So the maximum integer in M is 2, and there are four of it in M. So return 4.

Note:

• The range of m and n is [1,40000].
• The range of a is [1,m], and the range of b is [1,n].
• The range of operations size won’t exceed 10,000.

题意：给定m*n的矩阵，给定一组二元数对（a，b），使得矩阵中每行从0到a位置的元素相加等于a，每列从0到b位置的元素相加等于b，输出结束后矩阵中最大元素的个数。
思路：每次都要从位置0处开始相加，则从位置0开始，二元数对中最小的a和b处的所有元素，即为矩阵中的最大元素。

class Solution {
public:
    int maxCount(int m, int n, vector<vector<int>>& ops) {
        for (auto op : ops) {
            m = min(op[0], m);
            n = min(op[1], n);
        }
        return m * n;
    }
};