Leetcode-Set Matrix Zeroes

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.

click to show follow up.

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?

 

Analysis:

O(m+n) space is easy. The hard problem is O(1) space solution.

O(m+n) space solution:

public class Solution {
    public void setZeroes(int[][] matrix) {
        int xLen = matrix.length;
        if (xLen==0) return;
        int yLen = matrix[0].length;
        if (yLen==0) return;

        boolean[] rowZero = new boolean[xLen];
        boolean[] colZero = new boolean[yLen];
        Arrays.fill(rowZero,false);
        Arrays.fill(colZero,false);

        for (int i=0;i<xLen;i++)
            for (int j=0;j<yLen;j++)
                if (matrix[i][j]==0){
                    rowZero[i] = true;
                    colZero[j] = true;
                }

        for (int i=0;i<xLen;i++)
            for (int j=0;j<yLen;j++)
                if (rowZero[i] || colZero[j]) 
                    matrix[i][j] = 0;
        return;
    }
}

O(1) space solution:

We can use the first row and first col to store the information whether the row and the col should be turn to zero. If m[i][j]==0, then we set m[0][j]=m[i][0]=0. After scan all matrix, we then turn to zeroes according the information.

At last, if the first row and first col have zero at the begnning, we further turn them into zeroes.

NOTE: This very smart solution is not figured out by mysefl, so READ IT AGAIN.

public class Solution {
    public void setZeroes(int[][] matrix) {
        int xLen = matrix.length;
        if (xLen==0) return;
        int yLen = matrix[0].length;
        if (yLen==0) return;

        boolean firstRowZero = false, firstColZero = false;
        for (int i=0;i<xLen;i++)
            if (matrix[i][0]==0) {
                firstColZero = true;
                break;
            }

        for (int i=0;i<yLen;i++)
            if (matrix[0][i]==0) {
                firstRowZero = true;
                break;
            } 

        for (int i=1;i<xLen;i++)
            for (int j=1;j<yLen;j++)
                if (matrix[i][j]==0){
                    matrix[i][0] = 0;
                    matrix[0][j] = 0;
                }

        for (int i=1;i<xLen;i++)
            for (int j=1;j<yLen;j++)
                if (matrix[i][0]==0 || matrix[0][j]==0) 
                    matrix[i][j] = 0;
        if (firstRowZero)
            for (int i=0;i<yLen;i++) matrix[0][i]=0;
        if (firstColZero)
            for (int i=0;i<xLen;i++) matrix[i][0]=0;       

          
        return;
    }
}