Leetcode: 73. Set Matrix Zeroes(Week15, Medium)

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/linwh8/article/details/78828577

Leetcode 73
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.

• 题意：将矩阵中元素为0的对应行、列全部置0.
• 思路：遍历整个矩阵，用两个set容器存储0元素的行与列，然后扫描完后，再执行置0操作。其中，对置换行，可以赋值长为n且全为0的vector数组。
• 代码如下：

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        int m = matrix.size();
        int n =  matrix[0].size();
        set<int> x;
        set<int> y;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (matrix[i][j] == 0) {
                    x.insert(i);
                    y.insert(j);
                }
            }
        }
        vector<int> temp(n, 0);
        for (auto it = x.begin(); it != x.end(); it++) {
            matrix[*it] = temp;
        }
        for (auto it = y.begin(); it != y.end(); it++) {
            for (int i = 0; i < m; i++) {
                matrix[i][*it] = 0;
            }
        }
    }
};

---

以上内容皆为本人观点，欢迎大家提出批评和指导，我们一起探讨！

---