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:
Round 2:
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?
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
int row = 0, col = 0;
if(matrix.size() == 0 || matrix[0].size() == 0)
return;
for(int i = 0; i < matrix.size(); i++)
{
if(matrix[i][0] == 0)
{
col = 1;
break;
}
}
for(int i = 0; i < matrix[0].size(); i++)
{
if(matrix[0][i] == 0)
{
row = 1;
break;
}
}
for(int i = 1; i < matrix.size(); i++)
for(int j = 1; j < matrix[i].size(); j++)
{
if(matrix[i][j] == 0)
{
matrix[0][j] = 0;
matrix[i][0] = 0;
}
}
for(int i = 1; i < matrix.size(); i++)
for(int j = 1; j < matrix[i].size(); j++)
{
if(matrix[0][j] == 0 || matrix[i][0] == 0)
matrix[i][j] = 0;
}
if(col == 1)
{
for(int i = 0; i < matrix.size(); i++)
matrix[i][0] = 0;
}
if(row == 1)
{
for(int i = 0; i < matrix[0].size(); i++)
matrix[0][i] = 0;
}
}
};
Round 2:
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
int m = matrix.size();
int n = matrix[0].size();
bool col = false, row = false;
for(int i = 0; i < m; i++)
{
if(matrix[i][n-1] == 0)
{
col = true;
break;
}
}
for(int j = 0; j < n; j++)
{
if(matrix[m-1][j] == 0)
{
row = true;
break;
}
}
for(int i = 0; i < m-1; i++)
for(int j = 0; j < n-1; j++)
{
if(matrix[i][j] == 0)
{
matrix[m-1][j] = 0;
matrix[i][n-1] = 0;
}
}
for(int i = 0; i < m-1; i++)
for(int j = 0; j < n-1; j++)
{
if(matrix[m-1][j] == 0 || matrix[i][n-1] == 0)
matrix[i][j] = 0;
}
if(col)
{
for(int i = 0; i < m; i++)
matrix[i][n-1] = 0;
}
if(row)
{
for(int i = 0; i < n; i++)
matrix[m-1][i] = 0;
}
}
};