Range Addition II

 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: 4
Explanation: 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

Solution(Java):

class Solution {
    public int maxCount(int m, int n, int[][] ops) {
        int min=0, min1=0;
        if(ops.length==0){
            return m*n;
        }
        else{
            min=ops[0][0];
            for(int i=0;i<ops.length-1;i++){
                    if(ops[i+1][0]<min){
                       min=ops[i+1][0]; 
                    }
                }
            min1=ops[0][1];
            for(int i=0;i<ops.length-1;i++){
                    if(ops[i+1][1]<min1){
                       min1=ops[i+1][1]; 
                    }
                }
        }
        return min*min1;       
    }
}