[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?

class Solution {
public:
    /*algorithm
        use array A[1...m] , B[1..n] to book the row and col
        based on A array, set zero
        time O(m*n) space O(m+n)
    */
    void setZeroes(vector<vector<int>>& matrix) {
        int m = matrix.size(),n = matrix[0].size();
        vector<int>A(m,0),B(n,0);
        for(int i = 0;i < m;i++)
            for(int j = 0;j < n;j++){
                if(matrix[i][j] == 0){
                    A[i] = B[j] = 1;
                }
            }
        for(int i = 0;i < m;i++)
            if(A[i]){
                for(int j = 0;j < n;j++)
                    matrix[i][j] = 0;
            }
        
        for(int j = 0;j < n;j++)
            if(B[j]){
                for(int i = 0;i < m;i++)
                    matrix[i][j] = 0;
            }    
    }
};

class Solution {
public:
    /*algorithm
        use array A[1...m] , B[1..n] to book the row and col
        based on A array, set zero
        optimiation :use first line, first col to book, 
        time O(m*n) space O(1)
        1 0 3 4     * * * 4     * 0 0 4     0 0 0 0
        2 2 3 4  -->2 2 3 4 --> 2 0 0 4 --> 2 0 0 4
        3 1 0 7     * 1 0 7     * 0 0 7     0 0 0 0
        
        0 1 -->  * 1 --> * 1 --> 0 0
        
        0  --> * 
        1      1
    */
    void setZeroes(vector<vector<int>>& matrix) {
        int m = matrix.size(),n = matrix[0].size();
        //use matrix first line and first col to replace A,B array
        bool zeroRow = false,zeroColumn = false;
        for(int i = 0;i < m;i++)
            for(int j = 0;j < n;j++){
                if(matrix[i][j] == 0){
                    if(i == 0)zeroRow = true;
                    else matrix[i][0] = '*';
                    if(j == 0)zeroColumn = true;
                    else matrix[0][j] = '*';
                }
            }
        for(int j = 1;j < n;j++){
            if(matrix[0][j] == '*')
                for(int i = 0;i < m;i++)matrix[i][j] = 0;
        }
        
        for(int i = 1 ;i < m;i++){
            if(matrix[i][0] == '*')
                for(int j = 0;j < n;j++)matrix[i][j] = 0;
        }
        if(zeroRow){
            for(int j = 0;j < n;j++)matrix[0][j] = 0;
        }
        if(zeroColumn){
            for(int i = 0;i < m;i++)matrix[i][0] = 0;
        }
    }
};

class Solution {
public:
    /*algorithm
        use two pass method
        time O(m*n) space O(1)
        1 0 3 4     * * * *     0 0 0 4
        2 2 3 4  -->2 * * 4 --> 2 0 0 4
        3 1 0 7     * * 0 *     0 0 0 0
    */
    void setZeroes(vector<vector<int>>& matrix) {
        int m = matrix.size(),n = matrix[0].size();
        //first pass ,mark those to be changed element
        for(int i = 0;i < m;i++){
            for(int j = 0;j < n;j++){
                if(!matrix[i][j]){
                    //mark row
                    for(int k = 0;k < n;k++){
                        if(matrix[i][k])matrix[i][k]='*';
                    }
                    //mark col
                    for(int k = 0;k < m;k++){
                        if(matrix[k][j])matrix[k][j]='*';
                    }
                }
            }
        }
        
        //second pass, change those element to 0
        for(int i = 0;i < m;i++)
            for(int j = 0;j < n;j++){
                if(matrix[i][j] == '*')
                    matrix[i][j] = 0;
            }
    }
};