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:
Array
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?
Have you met this question in a real interview?
一开始题目理解的不清晰,我在想如果一个元素是0,将整行和整列置0后,该行和它下面的行岂不都是0了?!
看一组测试数据,有助于了解题意:
0 0 0 5 0 0 0 0
4 3 1 4 0 0 0 4
0 1 1 4 ---》 0 0 0 0
1 2 1 3 0 0 0 3
0 0 1 1 0 0 0 0
4 3 1 4 0 0 0 4
0 1 1 4 ---》 0 0 0 0
1 2 1 3 0 0 0 3
0 0 1 1 0 0 0 0
可以看到矩阵的原始元素0可以将该行和该列置0,但是后被置为0(矩阵的元素开始不是0,被置为了0)的元素,不在将该元素所在的行和列置0
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
int flag=0x3f3f3f3f;
int row=matrix.size();
int col=matrix[0].size();
if(row<1||col<1)
return ;
for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
{
if(matrix[i][j]==0)
{
for(int k=0;k<row;k++)
if(matrix[k][j]!=0)
matrix[k][j]=flag;
for(int l=0;l<col;l++)
if(matrix[i][l]!=0)
matrix[i][l]=flag;
}
}
for(int i=0;i<row;i++)
for(int j=0;j<col;j++)
if(matrix[i][j]==flag)
matrix[i][j]=0;
return ;
}
};