零矩阵
编写一种算法,若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]
]
来源:力扣(LeetCode)
Java题解
先记录后赋值即可,注意不要边获取边赋值,这样分辨不出来0是原来的还是后改的了
public void setZeroes(int[][] matrix) {
if (matrix.length == 0 || matrix[0].length == 0){
return;
}
int[] setI = new int[matrix.length];
int[] setJ = new int[matrix[0].length];
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length; j++) {
if(matrix[i][j] == 0){
setI[i] = 1;
setJ[j] = 1;
}
}
}
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length; j++) {
if(setI[i] == 1 || setJ[j] == 1){
matrix[i][j] = 0;
}
}
}
}