【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?

思路：先把整个矩阵搜一遍，一旦找到0便把它的行号和列号存起来（用两个数组即可），最后遍历数组把相应的行和列置0即可。

代码如下：

class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        if(matrix.empty()) return;
        int m = matrix.size(), n = matrix[0].size();
        vector<int> row, col;
        vector<int> zero;
        for(int i = 0; i<n; i++)    zero.push_back(0);
        
        for(int i=0; i<m; i++){
            for(int j=0; j<n; j++)
                if( matrix[i][j]==0) {
                    row.push_back(i);
                    col.push_back(j);
                }
        }
        row.erase(unique(row.begin(), row.end()),row.end());
        col.erase(unique(col.begin(), col.end()),col.end());

        for(int i = 0; i<row.size(); i++) matrix[row[i]]=zero;
        for(int i = 0; i<col.size(); i++) 
            for(int j = 0; j<m; j++)
                matrix[j][col[i]]=0;
    }
};

正常情况下这个的空间复杂度应该为小于O(m+n),但不为常数。vector的去重语句col.erase(unique(col.begin(), col.end()),col.end());当真神器啊！不用白不用23333333～