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.

这道题只需要找到X和Y两个方向的最小值就可以了，这个范围内的数字是最大值

class Solution {
    public int maxCount(int m, int n, int[][] ops) {
        if(ops == null || ops.length == 0)
            return m * n;

        int minX = ops[0][0];
        int minY = ops[0][1];
        for(int i = 1; i < ops.length; i++) {
            minX = Math.min(minX, ops[i][0]);
            minY = Math.min(minY, ops[i][1]);
        }

        return minX * minY;
    }
}