Interview question 01.08. Zero matrix

Subject requirements ：
Write an algorithm , if M × N An element in the matrix is 0, The row and column in which it is located are cleared .

 Example  1：
 Input ：
[
  [1,1,1],
  [1,0,1],
  [1,1,1]
]
 Output ：
[
  [1,0,1],
  [0,0,0],
  [1,0,1]
]

 Example  2：
 Input ：
[
  [0,1,2,0],
  [3,4,5,2],
  [1,3,1,5]
]
 Output ：
[
  [0,0,0,0],
  [0,4,5,0],
  [0,3,1,0]
]

class Solution {
    
public:
    void setZeroes(vector<vector<int>>& matrix) {
    
        int m, n;
        m = matrix.size();
        n = matrix[0].size();
        vector<int> row(m), col(n);
        for(int i = 0; i < m; i++)
        {
    
            for(int j = 0; j < n; j++)
            {
    
                if(matrix[i][j] == 0)
                {
    
                    row[i]=1;
                    col[j]=1;
                }
            }
        }
        for(int i = 0; i < m; i++)
        {
    
            for(int j = 0; j < n; j++)
            {
    
                if(row[i]||col[j])
                matrix[i][j] = 0;
            }
        }
    }
};

Experience ：
Create one dimension vector：
vector nums;// Do not specify length
vector nums(n); // The specified length is n

https://blog.csdn.net/cmy1130/article/details/88971585