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

最直观的方法可以用一个m*n的矩阵记录下0点。优化一下的话可以用长度为m和n的数组分别记录下0点的横纵坐标。要用constant space的话就考虑下利用所给矩阵本身的空间来储存需要的信息。于是我们找到第一个为0的点，用该点所在的行和列来记录下其他0点的横纵坐标。

代码如下：

class Solution {
public:
	void setZeroes(vector<vector<int> > &matrix) {
		int m(0), n(0);
		for (; m < matrix.size(); m++){
			for (n = 0; n < matrix[m].size(); n++)
			if (!matrix[m][n])
				break;
			if (n < matrix[m].size())
				break;
		}
		if (m >= matrix.size() || n >= matrix[0].size())
			return;
		for (int i = 0; i < matrix.size();i++)
		for (int j = 0; j < matrix[i].size(); j++)
		if (!matrix[i][j]){
			matrix[m][j] = 0;
			matrix[i][n] = 0;
		}
		for (int i = 0; i < matrix.size(); i++){
			if (!matrix[i][n] && i != m)
			for (int j = 0; j < matrix[i].size(); j++)
				matrix[i][j] = 0;
			else
				matrix[i][n] = 0;
		}
		for (int j = 0; j < matrix[m].size(); j++){
			if (!matrix[m][j] && j != n)
			for (int i = 0; i < matrix.size(); i++)
				matrix[i][j] = 0;
			else
				matrix[m][j] = 0;
		}
	}
};