LeetCode73(2021.3.21)

LC73. 矩阵置零

class Solution {
    public void setZeroes(int[][] matrix) {
        boolean fstColumn = false;
        int row = matrix.length;
        int col = matrix[0].length;
        for (int i = 0; i < row; ++i) {
            if (matrix[i][0] == 0) {
                fstColumn = true;
            }
            for (int j = 1; j < col; ++j) {
                if (matrix[i][j] == 0) {
                    matrix[i][0] = 0;
                    matrix[0][j] = 0;
                }
            }
        }
        for (int i = 1; i < col; ++i) {
            if (matrix[0][i] == 0) {
                for (int j = 1; j < row; ++j) {
                    matrix[j][i] = 0;
                }
            }
        }
        for (int i = 0; i < row; ++i) {
            if (matrix[i][0] == 0) {
                for (int j = 1; j < col; ++j) {
                    matrix[i][j] = 0;
                }
            }
        }
        if (fstColumn) {
            for (int i = 0; i < row; ++i) {
                matrix[i][0] = 0;
            }
        }
    }
}