【Leetcode】73. Set Matrix Zeroes[Medium]

Description

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:

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

Example

Example 1:

Input: 
[
  [1,1,1],
  [1,0,1],
  [1,1,1]
]
Output: 
[
  [1,0,1],
  [0,0,0],
  [1,0,1]
]

Example 2:

Input: 
[
  [0,1,2,0],
  [3,4,5,2],
  [1,3,1,5]
]
Output: 
[
  [0,0,0,0],
  [0,4,5,0],
  [0,3,1,0]
]

Solving

This problem could be divided into four parts:

• Recording the column’s changes by moving all column’s changes in rows into the first row, which means moving all 0 into the first row. Of course, a tag which can be named firstRowHasZero is needed to identify the first row has 0 or not. Because it can’t become 0 row right now.
• After every row’s traversal, if it has 0, changing it into 0 row, except the first row.
• When change of 0 rows finished, 0 columns begins accroding to the first row.
• Finally, change the first row into 0 row if it has 0.

class Solution {
    public void setZeroes(int[][] matrix) {
        boolean firstRowHasZero = false;
        // moving all 0 into the first row
        // changing every row who has 0 into 0 row
        for (int row = 0; row < matrix.length; row ++) {
            boolean rowHasZero = false;
            for (int col = 0; col < matrix[row].length; col ++) {
                if (row == 0 && matrix[row][col] == 0) {
                    firstRowHasZero = true;
                    break;
                }
                if (matrix[row][col] == 0) {
                    rowHasZero = true;
                    matrix[0][col] = 0;
                }
            }
            if (rowHasZero)
                for (int i = 0; i < matrix[row].length; i ++)
                    matrix[row][i] = 0;
        }
        
        // accroding to the first row
        // changing every col who has 0 into 0 col
        for (int i = 0; i < matrix[0].length; i ++)
            if (matrix[0][i] == 0)
                for (int j = 1; j < matrix.length; j ++)
                    matrix[j][i] = 0;
        
        // changing the first row into 0 zero if it has zero
        if (firstRowHasZero)
            for (int i = 0; i < matrix[0].length; i ++)
                matrix[0][i] = 0;
    }
}