We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b704d10 commit 72e6a3fCopy full SHA for 72e6a3f
src/main/java/com/fishercoder/solutions/_598.java
@@ -41,13 +41,15 @@
41
42
public class _598 {
43
44
- public int maxCount(int m, int n, int[][] ops) {
45
- int x = m;
46
- int y = n;
47
- for (int[] op : ops) {
48
- x = Math.min(x, op[0]);
49
- y = Math.min(y, op[1]);
+ public static class Solution1 {
+ public int maxCount(int m, int n, int[][] ops) {
+ int x = m;
+ int y = n;
+ for (int[] op : ops) {
+ x = Math.min(x, op[0]);
50
+ y = Math.min(y, op[1]);
51
+ }
52
+ return x * y;
53
}
- return x * y;
54
55
0 commit comments