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?
Subscribe to see which companies asked this question
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
set<pair<int,int>> s1;
int m=matrix.size();
int n=matrix[0].size();
for(int i=0;i<m;++i)
for(int j=0;j<n;++j)
{
if(matrix[i][j]==0)
{
s1.insert(pair<int,int>(i,j));
}
}
for(auto p: s1)
{
for(int i=0;i<n;++i)
matrix[p.first][i]=0;
for(int j=0;j<m;++j)
matrix[j][p.second]=0;
}
return ;
}
};