Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.
Example 1:
Input: [ [1,1,1], [1,0,1], [1,1,1] ] Output: [ [1,0,1], [0,0,0], [1,0,1] ]
Example 2:
Input: [ [0,1,2,0], [3,4,5,2], [1,3,1,5] ] Output: [ [0,0,0,0], [0,4,5,0], [0,3,1,0] ]
Follow up:
- 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?
void setZeroes(int** matrix, int matrixRowSize, int matrixColSize) {
int i,j,flag1=0,flag2=0,flag3=0;
if(matrix[0][0]==0)
flag3=1;
for(i=0;i<matrixRowSize;i++)
{
if(matrix[i][0]==0)
flag1=1;
}
for(i=0;i<matrixColSize;i++)
{
if(matrix[0][i]==0)
flag2=1;
}
for(i=1;i<matrixRowSize;i++)
{
for(j=1;j<matrixColSize;j++)
{
if(matrix[i][j]==0)
{
matrix[i][0]=0;
matrix[0][j]=0;
}
}
}
for(i=1;i<matrixRowSize;i++)
{
if(matrix[i][0]==0)
{
for(j=1;j<matrixColSize;j++)
{
matrix[i][j]=0;
}
}
}
for(i=1;i<matrixColSize;i++)
{
if(matrix[0][i]==0)
{
for(j=1;j<matrixRowSize;j++)
{
matrix[j][i]=0;
}
}
}
if(flag3)
{
for(i=1;i<matrixRowSize;i++)
{
matrix[i][0]=0;
}
for(i=1;i<matrixColSize;i++)
{
matrix[0][i]=0;
}
}
else
{
if(flag1)
{
for(i=0;i<matrixRowSize;i++)
{
matrix[i][0]=0;
}
}
if(flag2)
{
for(i=0;i<matrixColSize;i++)
{
matrix[0][i]=0;
}
}
}
}