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?
使用常量空间,先将含 0 的保存在第一行和第一列中。
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
int m = matrix.size();
int n = matrix[0].size();
bool rowhaszero = false;
bool columnhaszero = false;
for (int i = 0; i < m; i++) {
if (matrix[i][0] != 0)
continue;
else {
columnhaszero = true;
break;
}
}
for (int j = 0; j < n; j++) {
if (matrix[0][j] != 0)
continue;
else {
rowhaszero = true;
break;
}
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
if (matrix[i][j] != 0)
continue;
else {
matrix[i][0] = 0;
break;
}
}
}
for (int j = 1; j < n; j++) {
for (int i = 1; i < m; i++) {
if (matrix[i][j] != 0)
continue;
else {
matrix[0][j] = 0;
break;
}
}
}
for (int i = 1; i < m; i++) {
if (matrix[i][0] != 0)
continue;
else {
for (int j = 1; j < n; j++)
matrix[i][j] = 0;
}
}
for (int j = 1; j < n; j++) {
if (matrix[0][j] != 0)
continue;
else {
for (int i = 1; i < m; i++)
matrix[i][j] = 0;
}
}
if (columnhaszero)
for (int i = 0; i < m; i++)
matrix[i][0] = 0;
if (rowhaszero)
for (int j = 0; j < n; j++)
matrix[0][j] = 0;
}
};