Clear c++ solution


  • 0
    B
    class Solution {
    public:
        int maxCount(int m, int n, vector<vector<int>>& ops) {
        	int x = m, y = n;
        	for(int i = 0; i < ops.size(); i++) {
        		x = min(x, op[i][0]);
        		y = min(y, op[i][1]);
        	}
            return x*y;
        }
    };
    

Log in to reply
 

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