Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
Follow up:
In place的要求,我的思路是用第一次出现0的行存竖列的状态,如果发现0,就在这一排把对应位置1,当把当前行的0全部找完后,如果有0,则把这行全置0,继续搜索下一行。当全部行搜索完后,根据保存竖列信息的那一行,把对应列置0。代码如下:
Did you use extra space?
A straight forward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?
public class Solution {
public void setZeroes(int[][] matrix) {
int zero1row = -1;
boolean flag = false;
boolean hasZero = false;
int row = matrix.length;
int col = matrix[0].length;
for (int i = 0; i < row; i ++) {
for (int j = 0; j < col; j ++) {
if(matrix[i][j] == 0) {
if (flag == false) {
zero1row = i;
flag = true;
for (int k = 0; k < col; k ++) {
if(matrix[i][k] == 0) {
matrix[zero1row][k] = 1;
} else {
matrix[zero1row][k] = 0;
}
}
break;
}
matrix[zero1row][j] = 1;
hasZero = true;
}
}
if (hasZero == true) {
for (int k = 0; k < col; k ++) {
matrix[i][k] = 0;
}
}
hasZero = false;
}
if (zero1row == -1) {
return;
}
for (int j = 0; j < col; j ++) {
if (matrix[zero1row][j] == 1) {
for (int i = 0; i < row; i ++) {
matrix[i][j] = 0;
}
}
}
for (int j = 0; j < col; j ++) {
matrix[zero1row][j] = 0;
}
}
}
在Top Solution里看到用每一行的第一个和每一列的第一个存储当前行和列是不是应该置0,条理更清晰,代码如下:
void setZeroes(vector<vector<int> > &matrix) {
int col0 = 1, rows = matrix.size(), cols = matrix[0].size();
for (int i = 0; i < rows; i++) {
if (matrix[i][0] == 0) col0 = 0;
for (int j = 1; j < cols; j++)
if (matrix[i][j] == 0)
matrix[i][0] = matrix[0][j] = 0;
}
for (int i = rows - 1; i >= 0; i--) {
for (int j = cols - 1; j >= 1; j--)
if (matrix[i][0] == 0 || matrix[0][j] == 0)
matrix[i][j] = 0;
if (col0 == 0) matrix[i][0] = 0;
}
}