代码如下:
class Solution {
public:
int m, n;
vector<vector<int>> res;
void sumx(int x){
for(int i = 0; i < n; i ++)
res[x][i] ++;
}
void sumy(int y){
for(int i = 0; i < m; i ++)
res[i][y] ++;
}
int oddCells(int _m, int _n, vector<vector<int>>& indices) {
m = _m, n = _n;
res = vector<vector<int>>(m, vector<int>(n));
for(auto p: indices){
int x = p[0], y = p[1];
sumx(x);
sumy(y);
}
int ans = 0;
for(int i = 0; i < m; i ++)
for(int j = 0; j < n; j ++)
if(res[i][j] % 2 != 0)
ans ++;
return ans;
}
};