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.

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]
]

代码1：

空间复杂度为O(m + n)

struct node
{
  int row;
    int col;
};

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        int rows = matrix.size();
        if(rows == 0)
            return;
        int cols = matrix[0].size();
        vector<node> vec;
        for(int i = 0; i < rows; ++i)
        {
            for(int j = 0; j < cols; ++j)
            {
                if(matrix[i][j] == 0)
                {
                    node n;
                    n.row = i;
                    n.col = j;
                    vec.push_back(n);
                }
            }
        }
        for(int i = 0; i < (int)vec.size(); ++i)
        {
            for(int j = 0; j < rows; ++j)
                matrix[j][vec[i].col] = 0;
            for(int j = 0; j < cols; ++j)
                matrix[vec[i].row][j] = 0;
        }
    }
};

代码2：

空间复杂度为O(1)

解析：

My idea is simple: store states of each row in the first of that row, and store states of each column in the first of that column. Because the state of row0 and the state of column0 would occupy the same cell, I let it be the state of row0, and use another variable “col0” for column0. In the first phase, use matrix elements to set states in a top-down way. In the second phase, use states to set matrix elements in a bottom-up way.

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        int rows = matrix.size();
        if(rows == 0)
            return;
        int cols = matrix[0].size();
        int col0 = 1;
        for(int i = 0; i < rows; ++i)
        {
            if(matrix[i][0] == 0)
                col0 = 0;
            for(int j = 1; j < cols; ++j)
            {
                if(matrix[i][j] == 0)
                    matrix[i][0] = matrix[0][j] = 0;
            }
        }
        for(int i = rows - 1; i >= 0; --i)
        {
            for(int j = cols - 1; j >= 1; --j)
            {
                if(matrix[i][0] == 0 || matrix[0][j] == 0)
                    matrix[i][j] = 0;              
            }
            if(col0 == 0)
                matrix[i][0] = 0;
        }
    }
};

此方法是借鉴LeetCode上的解答。