【LeetCode73】矩阵置零

题目描述：

首刷自解：

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        int m = matrix.size();
        int n = matrix[0].size();
        vector<int> zeroPos;
        for (int pos = 0; pos < m * n; ++pos)
        {
            if (!matrix[pos / n][pos % n])
                zeroPos.push_back(pos);
        }

        for (const auto& iter : zeroPos)
        {
            for(int row = 0; row < n; ++row)
                matrix[iter / n][row] = 0;
            for (int column = 0; column < m; ++column)
                matrix[column][iter % n] = 0;
        }
    }
};