Leetcode_set-matrix-zeroes

地址：http://oj.leetcode.com/problems/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?

思路：用O(1)的额外空间。如果矩阵中i行j列的那个数为0，则将matrix[0][j]和matrix[i][0]设置为0.遍历完矩阵后，检查首行和首列，逐行逐列置零。

首行首列要先预处理，因为之后首行首列作为信息位存储，本身的值被覆盖了。做这题要特别细心。

参考代码：

class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        if(matrix.empty())
            return;
        int row = matrix.size(), col = matrix[0].size();
        bool set_first_row_zero = false, set_first_col_zero = false;
        for(int i = 0; i<row; ++i)
        {
            if(matrix[i][0]==0)
            {
                set_first_col_zero = true;
                break;
            }
        }
        for(int j = 0; j<col; ++j)
        {
            if(matrix[0][j]==0)
            {
                set_first_row_zero = true;
                break;
            }
        }
        for(int i = 1; i<row; ++i)
        {
            for(int j = 1; j<col; ++j)
            {
                if(matrix[i][j]==0)
                {
                    matrix[i][0] = matrix[0][j] = 0;
                }
            }
        }
        for(int i = 1; i<row; ++i)
        {
            if(matrix[i][0]==0)
            {
                for(int j = 0; j<col; ++j)
                    matrix[i][j] = 0;
            }
        }
        for(int j = 1; j<col; ++j)
        {
            if(matrix[0][j]==0)
            {
                for(int i = 0; i<row; ++i)
                    matrix[i][j] = 0;
            }
        }
        if(set_first_row_zero)
        {
            for(int j = 0; j<col; ++j)
                matrix[0][j] = 0;
        }
        if(set_first_col_zero)
        {
            for(int i = 0; i<row; ++i)
                matrix[i][0] = 0;
        }
    }
};