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:
java code : O(m + n) space, O(mn) time complexity.
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?
public class Solution {
public void setZeroes(int[][] matrix) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(matrix == null)
return ;
int m = matrix.length;
int n = matrix[0].length;
int[] row = new int[m];
int[] col = new int[n];
for(int i = 0; i < m; i++)
{
for(int j = 0; j < n; j++)
{
if(matrix[i][j] == 0)
{
row[i] = 1;
col[j] = 1;
}
}
}
for(int i = 0; i < m; i++)
{
if(row[i] == 1)
{
for(int j = 0; j < n; j++)
matrix[i][j] = 0;
}
}
for(int j = 0; j < n; j++)
{
if(col[j] ==1)
{
for(int i = 0; i < m ; i++)
matrix[i][j] = 0;
}
}
row = null;
col = null;
}
}