[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.

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?

分别记录两个向量x, y，保存行和列是否有0，再次遍历数组时查询对应的行和列然后修改值。

class Solution {
private:
    bool x[1000];
    bool y[1000];
public:
    void setZeroes(vector<vector<int> > &matrix) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        memset(x, false, sizeof(x));
        memset(y, false, sizeof(y));
        
        for(int i = 0; i < matrix.size(); i++)
            for(int j = 0; j < matrix[i].size(); j++)
                if (matrix[i][j] == 0)
                {
                    x[i] = true;
                    y[j] = true;
                }
                
        for(int i = 0; i < matrix.size(); i++)
            for(int j = 0; j < matrix[i].size(); j++)
                if (x[i] || y[j])
                    matrix[i][j] = 0;
    }
};