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.

示例：

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.

问题分析：

本题实际是求所给的各个[a,b]中行数最小值和列数最小值，最终两者的乘积就是答案。

过程详见代码：

class Solution {
public:
    int maxCount(int m, int n, vector<vector<int>>& ops) {
        int col = n;
		int row = m;
		for (int i = 0; i < ops.size(); i++)
		{
			row = min(ops[i][0], row);
			col = min(ops[i][1], col);
		}
		return col * row;
    }
};