73. 矩阵置零——空间复杂度O(1)

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        int rows = matrix.size(), columns = matrix[0].size();
        bool flagrow0 = false, flagcolumn0 = false;
        for(int i = 0; i < rows; i++)
            if(matrix[i][0] == 0){
                flagcolumn0 = true;
                break;
            }
        for(int i = 0; i < columns; i++)
            if(matrix[0][i] == 0){
                flagrow0 = true;
                break;
            }
        for(int i = 1; i < rows; i++){
            for(int j = 1; j < columns; j++){
                if(matrix[i][j] == 0){
                    matrix[0][j] = matrix[i][0] = 0;
                }
            }
        }

        for(int i = 1; i < rows; i++){
            for(int j = 1; j < columns; j++){
                if(matrix[i][0] == 0 || matrix[0][j] == 0){
                    matrix[i][j] = 0;
                }
            }
        }

        if(flagcolumn0)
            for(int i = 0; i < rows; i++)
                matrix[i][0] = 0;
        if(flagrow0)
            for(int i = 0; i < columns; i++)
                matrix[0][i] = 0;
    }
};

Accepted
164/164 cases passed (20 ms)
Your runtime beats 7.26 % of cpp submissions
Your memory usage beats 93.73 % of cpp submissions (12.7 MB)