class Solution {
public int maxCount(int m, int n, int[][] ops) {
int min_x=m,min_y=n;
for(int[] is: ops){
min_x=Math.min(min_x,is[0]);
min_y=Math.min(min_y,is[1]);
}
return min_x*min_y;
}
}
leetcode 598. 范围求和 II
最新推荐文章于 2024-06-22 22:59:06 发布