leetCode598

今天是离职的最后一天，把我在我司写的leetcode代码全部贴一下~

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