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.

要求：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?

space complexity O(m+n)的解法：

void setZeroes(vector<vector<int>>& matrix) {
	int row=matrix.size();
	if (row<1) return;
	int col=matrix[0].size();
	if(col<1) return;
	bool exsitzero=false;
	for (int i = 0; i < row; i++)
	{
		exsitzero=false;
		for (int j = 0; j < col; j++)
		{
			if (matrix[i][j]==0)
			{
				exsitzero=true;
				for (int k = 0; k < i; k++)
				{
					matrix[k][j]=0;
				}
			}
		}
		if (exsitzero)
		{
			for (int j = 0; j < col; j++)
			{
				matrix[i][j]=0;
			}
		}
		
	}
	for (int i = 0; i < col; i++)
	{
		if (matrix[0][i]==0&&matrix[row-1][i]!=0)
		{
			for (int j = row-1; j >=0 &&matrix[j][i]!=0; j--)
			{
				matrix[j][i]=0;
			}
		}
	}
}

space complexity O(1)的解法：（转字leetcode评论区，非原创）

</pre><pre>

void setZeroes(vector<vector<int>>& matrix) {
    const int row = matrix.size();
    if (0 == row) return;
    const int col = matrix[0].size();
    bool flag_r = false, flag_c = false; 
    for (int i = 0; i < row; i++) 
        for (int j = 0; j < col; j++) {
            if (matrix[i][j] == 0) {
                if (i == 0) flag_r = true;
                if (j == 0) flag_c = true;
                matrix[i][0] = matrix[0][j] = 0;
            }
    }
    for (size_t i = 1; i < row; i++)
          for (size_t j = 1; j < col; j++) {
              if (matrix[i][0] == 0 || matrix[0][j] == 0) matrix[i][j] = 0;
    }
    if (flag_r) fill(matrix[0].begin(), matrix[0].end(), 0);
    if (flag_c) 
        for (int i = 0; i < row; i++)  matrix[i][0] = 0;
}