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

要求不能用extra space。想法如下：

1.扫描第一行和第一列，记录第一行和第一列是否需要变成0

2.扫描剩下的元素，当matrix[i][j]==0时，将该元素所在的第一行和第一列元素设成0.即matrix[i][0]=0,matrix[0][j]=0.

3.扫描第一行和第一列（注意这里i和j都要从1开始），发现有0，就把对应的行或者列全设成0

4.根据步骤1的结果决定是否把第一行和第一列置0

public class Solution {
    public void setZeroes(int[][] matrix) {
        boolean firstRowIsZero = false;
        boolean firstColumnIsZero = false;
        int m = matrix.length;
        int n = matrix[0].length;
        for(int i = 0; i < m; i++){
            if(matrix[i][0] == 0){
                firstColumnIsZero = true;
                break;
            }
        }
        for(int i = 0; i < n; i++){
            if(matrix[0][i] == 0){
                firstRowIsZero = true;
                break;
            }
        }

        for(int i = 1; i < m; i++){
            for(int j = 1; j < n; j++){
                if(matrix[i][j] == 0){
                    matrix[i][0] = 0;
                    matrix[0][j] = 0;
                }
            }
        }
        //Must start from 1 here
        for(int i = 1; i < m; i++){
            if(matrix[i][0] == 0){
                for(int j = 1; j < n; j++){
                    matrix[i][j] = 0;
                }
            }
        }
        for(int j = 1; j < n; j++){
            if(matrix[0][j] == 0){
                for(int i = 1; i < m; i++){
                    matrix[i][j] = 0;
                }
            }
        }
        if(firstColumnIsZero == true){
            for(int i = 0; i < m; i++)
                matrix[i][0] = 0;
        }
        if(firstRowIsZero == true){
            for(int j = 0; j < n; j++)
                matrix[0][j] = 0;
        }
    }
}