Problem:
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:
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?
Analysis:
Solutions:
C++:
void setZeroes(vector<vector<int> > &matrix) {
int row = matrix.size();
int col = matrix[0].size();
if(row == 0 || col == 0)
return;
bool setFirstColumnZero = false;
for(int i = 0; i < row; ++i) {
if(matrix[i][0] == 0) {
setFirstColumnZero = true;
break;
}
}
bool setFirstRowZero = false;
for(int i = 0; i < col; ++i) {
if(matrix[0][i] == 0) {
setFirstRowZero = true;
break;
}
}
for(int i = 1; i < row; ++i) {
for(int j = 1; j < col; ++j) {
if(matrix[i][j] == 0) {
if(matrix[i][0] != 0)
matrix[i][0] = 0;
if(matrix[0][j] != 0)
matrix[0][j] = 0;
}
}
}
for(int i = 1; i < row; ++i) {
if(matrix[i][0] == 0) {
for(int j = 0; j < col; ++j)
matrix[i][j] = 0;
}
}
for(int i = 1; i < col; ++i) {
if(matrix[0][i] == 0) {
for(int j = 0; j < row; ++j)
matrix[j][i] = 0;
}
}
if(setFirstRowZero) {
for(int i = 0; i < col; ++i)
matrix[0][i] = 0;
}
if(setFirstColumnZero) {
for(int i = 0; i < row; ++i)
matrix[i][0] = 0;
}
}
Java:
Python: