Java easy to understand


  • 1
    G

    this is my code:

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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.