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?
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
int r = matrix.size();
int c = matrix[0].size();
int *row = new int[r];
int *col = new int[c];
memset(row, 0, sizeof(int) * r);
memset(col, 0, sizeof(int) * c);
for(int i = 0; i < r; i++)
{
for(int j = 0; j < c; j++)
if(matrix[i][j] == 0)
{
row[i] = 1;
col[j] = 1;
}
}
for(int i = 0; i < r; i++)
{
for(int j = 0; j < c; j++)
{
if(row[i] || col[j])
matrix[i][j] = 0;
}
}
}
};
根据说明,好像我的方法不是很牛逼。。。如何改进呢?