[leetCode刷题笔记]598. Range Addition II

无聊的奇葩题目。。。

public class Solution {    public int maxCount(int m, int n, int[][] ops) {        if (ops == null || ops.length == 0) return m * n;                int col = Integer.MAX_VALUE;        int row = Integer.MAX_VALUE;                for (int[] column : ops) {            row  = Math.min(row, column[0]);            col = Math.min(col, column[1]);        }                return row * col;    }}