leetcode

0 class Solution {

1 public:

2 vector<vector<int>> onesMinusZeros(vector<vector<int>> &grid) {

3 int n = grid.size(), m = grid[0].size();

4 vector<int> col(n, 0), row(m, 0);

5 for (int i = 0; i < n; i++) {

6 for (int j = 0; j < m; j++) {

7 col[i] += grid[i][j];

8 row[j] += grid[i][j];

9 }

10 }

11 for (int i = 0; i < n; i++) {

12 for (int j = 0; j < m; j++) {

13 grid[i][j] = 2 * (col[i] + row[j]) - (m + n);

14 }

15 }

16

17 return grid;

18 }

19 };