编写一种算法,若M × N矩阵中某个元素为0,则将其所在的行与列清零。
示例 1:
输入:
[
[1,1,1],
[1,0,1],
[1,1,1]
]
输出:
[
[1,0,1],
[0,0,0],
[1,0,1]
]
示例 2:
输入:
[
[0,1,2,0],
[3,4,5,2],
[1,3,1,5]
]
输出:
[
[0,0,0,0],
[0,4,5,0],
[0,3,1,0]
]
方法1:一维数组标记
public void setZeroes(int[][] matrix) {
int R = matrix.length, C = matrix[0].length;
boolean[] rows = new boolean[R];
boolean[] cols = new boolean[C];
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) {
if (matrix[i][j] == 0) {
rows[i] = true;
cols[j] = true;
}
}
}
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) {
if (rows[i] || cols[j]) matrix[i][j] = 0;
}
}
}
方法2:第一行做标记
public void setZeroes(int[][] matrix) {
boolean firstRowHasZero = false;
boolean firstColHasZero = false;
int R = matrix.length, C = matrix[0].length;
for (int i = 0; i < R; i++) {
if (matrix[i][0] == 0) {
firstColHasZero = true;
break;
}
}
for (int j = 0; j < C; j++) {
if (matrix[0][j] == 0) {
firstRowHasZero = true;
break;
}
}
for (int i = 1; i < R; i++) {
for (int j = 1; j < C; j++) {
if (matrix[i][j] == 0) {
matrix[i][0] = 0;
matrix[0][j] = 0;
}
}
}
for (int i = 1; i < R; i++) {
for (int j = 1; j < C; j++) {
if (matrix[i][0] == 0 || matrix[0][j] == 0) matrix[i][j] = 0;
}
}
for (int i = 0; i < R; i++) {
if (firstColHasZero) matrix[i][0] = 0;
}
for (int j = 0; j < C; j++) {
if (firstRowHasZero) matrix[0][j] = 0;
}
}