6277. 行和列中一和零的差值
难度中等0
给你一个下标从 0 开始的 m x n
二进制矩阵 grid
。
我们按照如下过程,定义一个下标从 0 开始的 m x n
差值矩阵 diff
:
- 令第
i
行一的数目为onesRowi
。 - 令第
j
列一的数目为onesColj
。 - 令第
i
行零的数目为zerosRowi
。 - 令第
j
列零的数目为zerosColj
。 diff[i][j] = onesRowi + onesColj - zerosRowi - zerosColj
请你返回差值矩阵 diff
。
示例 1:
输入:grid = [[0,1,1],[1,0,1],[0,0,1]]
输出:[[0,0,4],[0,0,4],[-2,-2,2]]
解释:
- diff[0][0] = onesRow0 + onesCol0 - zerosRow0 - zerosCol0 = 2 + 1 - 1 - 2 = 0
- diff[0][1] = onesRow0 + onesCol1 - zerosRow0 - zerosCol1 = 2 + 1 - 1 - 2 = 0
- diff[0][2] = onesRow0 + onesCol2 - zerosRow0 - zerosCol2 = 2 + 3 - 1 - 0 = 4
- diff[1][0] = onesRow1 + onesCol0 - zerosRow1 - zerosCol0 = 2 + 1 - 1 - 2 = 0
- diff[1][1] = onesRow1 + onesCol1 - zerosRow1 - zerosCol1 = 2 + 1 - 1 - 2 = 0
- diff[1][2] = onesRow1 + onesCol2 - zerosRow1 - zerosCol2 = 2 + 3 - 1 - 0 = 4
- diff[2][0] = onesRow2 + onesCol0 - zerosRow2 - zerosCol0 = 1 + 1 - 2 - 2 = -2
- diff[2][1] = onesRow2 + onesCol1 - zerosRow2 - zerosCol1 = 1 + 1 - 2 - 2 = -2
- diff[2][2] = onesRow2 + onesCol2 - zerosRow2 - zerosCol2 = 1 + 3 - 2 - 0 = 2
示例 2:
输入:grid = [[1,1,1],[1,1,1]]
输出:[[5,5,5],[5,5,5]]
解释:
- diff[0][0] = onesRow0 + onesCol0 - zerosRow0 - zerosCol0 = 3 + 2 - 0 - 0 = 5
- diff[0][1] = onesRow0 + onesCol1 - zerosRow0 - zerosCol1 = 3 + 2 - 0 - 0 = 5
- diff[0][2] = onesRow0 + onesCol2 - zerosRow0 - zerosCol2 = 3 + 2 - 0 - 0 = 5
- diff[1][0] = onesRow1 + onesCol0 - zerosRow1 - zerosCol0 = 3 + 2 - 0 - 0 = 5
- diff[1][1] = onesRow1 + onesCol1 - zerosRow1 - zerosCol1 = 3 + 2 - 0 - 0 = 5
- diff[1][2] = onesRow1 + onesCol2 - zerosRow1 - zerosCol2 = 3 + 2 - 0 - 0 = 5
提示:
m == grid.length
n == grid[i].length
1 <= m, n <= 105
1 <= m * n <= 105
grid[i][j]
要么是0
,要么是1
。
模拟
class Solution {
public int[][] onesMinusZeros(int[][] grid) {
int m = grid.length, n = grid[0].length;
int[][] res = new int[m][n];
int[] helpcol = new int[n]; //第i列1的数目
int[] helprow = new int[m]; //第i行1的数目
for(int i = 0; i < m; i++){ // 行
for(int j = 0; j < n; j++){ // 列
//先记录一下各行各列 1的数目
helpcol[j] += grid[i][j];
helprow[i] += grid[i][j];
}
}
// 按照题意求解
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
res[i][j] = helprow[i] + helpcol[j] -(m-helprow[i]) - (n-helpcol[j]);
}
}
return res;
}
}
优雅的模拟
题解:0x3f
优化 1:由于行和列都可以看成是 1 的个数减去 0 的个数,所以统计的时候,可以把 0 当成 -1。
优化 2:答案可以直接填到 grid \textit{grid} grid 中。
diff[i][j] = onesRowi + onesColj - zerosRowi - zerosColj
==>
diff[i][j] = onesRowi - zerosRowi + onesColj - zerosColj
class Solution:
def onesMinusZeros(self, grid: List[List[int]]) -> List[List[int]]:
r = [0] * len(grid)
c = [0] * len(grid[0])
for i, row in enumerate(grid):
for j, x in enumerate(row):
r[i] += x * 2 - 1
c[j] += x * 2 - 1 # 1 -> 1, 0 -> -1
for i, x in enumerate(r):
for j, y in enumerate(c):
grid[i][j] = x + y
return grid