leetcode 1252. 奇数值单元格的数目 by lbh

java

class Solution {
public:
    int oddCells(int n, int m, vector<vector<int>>& indices) {
    	if(indices.size()==0)return 0;
    	int res[n][m]={0};
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                res[i][j]=0;
    	int ans=0;
        for(int i=0;i<indices.size();i++){
            cout<<indices[i][0]<<" "<<indices[i][1]<<endl;
        	for(int j=0;j<m;j++){
        		res[indices[i][0]][j]++;
        		if(res[indices[i][0]][j]%2==1)ans++;
        		else ans--;
			}
			for(int j=0;j<n;j++){
        		res[j][indices[i][1]]++;
        		if(res[j][indices[i][1]]%2==1)ans++;
        		else ans--;
			}
		} 
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                cout<<res[i][j]<<" ";
		return ans;
    }
};