73. 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?

Solution 1

// O(m + n) CC150 1.7
	public void setZeroes(int[][] matrix) {
		boolean[] row = new boolean[matrix.length];
		boolean[] column = new boolean[matrix[0].length];
		for (int i = 0; i < matrix.length; i++) {
			for (int j = 0; j < matrix[0].length; j++) {
				if (matrix[i][j] == 0) {
					row[i] = true;
					column[j] = true;
				}
			}
		}

		for (int i = 0; i < matrix.length; i++) {
			for (int j = 0; j < matrix[0].length; j++) {
				if (row[i] || column[j]) {
					matrix[i][j] = 0;
				}
			}
		}
	}

Solution 2

https://leetcode.com/discuss/15997/any-shortest-o-1-space-solution

// O(1)space
	/*store states of each row in the first of that row,
	and store states of each column in the first ofthat column.
	Because the state of row0 and the state of column0
	would occupy the same cell,
	I let it be the state of row0, and use another variable"col0"for
	column0. In thefirst phase, use matrix elements to set
	states ina top-down way.
	In thes econd phase, use states to
	set matrix elements in a bottom-up way.*/

	public static void setZeroes2(int[][] matrix) {
		int col = 1, m = matrix.length, n = matrix[0].length;

		for (int i = 0; i < m; i++) {
			if (matrix[i][0] == 0)
				col = 0;
			for (int j = 1; j < n; j++)
				if (matrix[i][j] == 0)
					matrix[i][0] = matrix[0][j] = 0;
		}

		for (int i = m - 1; i >= 0; i--) {
			for (int j = n - 1; j >= 1; j--){
				if (matrix[i][0] == 0 || matrix[0][j] == 0){
					matrix[i][j] = 0;
				}
			if (col == 0)
				matrix[i][0] = 0;
			}
		}
	}