class Solution {
public int maxCount(int m, int n, int[][] ops) {
int min1 = m, min2 = n;
for(int[] l: ops){
min1 = Math.min(min1,l[0]);
min2 = Math.min(min2,l[1]);
}
return min1*min2;
}
}
12-04
580
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-04
631
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-04
1325
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-06
708
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-04
940
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交