Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
public class Solution {
public void setZeroes(int[][] matrix) {
int[] row = new int[matrix.length];
int[] column = new int[matrix[0].length];
for (int i = 0; i < row.length; i++) {
for (int j = 0; j < column.length; j++) {
if (matrix[i][j] == 0) {
row[i] = 1;
column[j] = 1;
}
}
}
for (int i = 0; i < row.length; i++) {
for (int j = 0; j < column.length; j++) {
if (row[i] == 1 || column[j] == 1) {
matrix[i][j] = 0;
}
}
}
}
}
Another solution: we use the first row and first column to replace int[] row and int[] column.
public class Solution {
public void setZeroes(int[][] matrix) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return;
boolean isColHasZero = false;
boolean isRowHasZero = false;
for (int i = 0; i < matrix[0].length; i++) {
if (matrix[0][i] == 0) {
isColHasZero = true;
break;
}
}
for (int i = 0; i < matrix.length; i++) {
if (matrix[i][0] == 0) {
isRowHasZero = true;
break;
}
}
for (int i = 1; i < matrix.length; i++) {
for (int j = 1; j < matrix[0].length; j++) {
if (matrix[i][j] == 0) {
matrix[0][j] = 0;
matrix[i][0] = 0;
}
}
}
for (int i = 1; i < matrix.length; i++) {
for (int j = 1; j < matrix[0].length; j++) {
if (matrix[0][j] == 0 || matrix[i][0] == 0) {
matrix[i][j] = 0;
}
}
}
if (isColHasZero == true) {
for (int i = 0; i < matrix[0].length; i++) {
matrix[0][i] = 0;
}
}
if (isRowHasZero == true) {
for (int i = 0; i < matrix.length; i++) {
matrix[i][0] = 0;
}
}
}
}