[Leetcode] 598. 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:

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

思路：

想明白了就很简单：其实就是求各个有效的operation的操作区间的重合区域。注意一个operation有效当且仅当a和b都大于等于1（否则这个operation对矩阵不产生影响）。算法的时间复杂度是O(n)，其中n是operation的个数。

代码：

class Solution {
public:
    int maxCount(int m, int n, vector<vector<int>>& ops) {
        int min_row = m, min_col = n;
        for (int i = 0; i < ops.size(); ++i) {
            if (ops[i][0] >= 1 && ops[i][1] >= 1) { // only in this case it is effective
                min_row = min(min_row, ops[i][0]);
                min_col = min(min_col, ops[i][1]);
            }
        }
        return min_row * min_col;
    }
};