题目:
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行和列。提前保留第一行第一列信息,最后restore.
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
if (matrix.size() == 0) return;
bool row_zero = false;
bool col_zero = false;
int row_size = (int)matrix.size();
int col_size = (int)matrix[0].size();
// save the state of the first row and column
for (int i = 0; i < row_size; ++i) {
if (matrix[i][0] == 0) {
col_zero = true;
break;
}
}
for (int j = 0; j < col_size; ++j) {
if (matrix[0][j] == 0) {
row_zero = true;
break;
}
}
// mark the rows and columns
for (int i = 1; i < row_size; ++i) {
for (int j = 1; j < col_size; ++j) {
if (matrix[i][j] == 0) {
matrix[i][0] = 0;
matrix[0][j] = 0;
}
}
}
// set zero
for (int i = 1; i < row_size; ++i) {
if (matrix[i][0] == 0) {
for (int j = 0; j < col_size; ++j) {
matrix[i][j] = 0;
}
}
}
for (int j = 1; j < col_size; ++j) {
if (matrix[0][j] == 0) {
for (int i = 0; i < row_size; ++i) {
matrix[i][j] = 0;
}
}
}
// set the first row and column
if (row_zero) {
for (int j = 0; j < col_size; ++j) {
matrix[0][j] = 0;
}
}
if (col_zero) {
for (int i = 0; i < row_size; ++i) {
matrix[i][0] = 0;
}
}
}
};
总结:时间复杂度O(mn),空间复杂度O(1). 空间复杂度O(mn)解法是将整个矩阵备份,O(m + n)解法是利用额外的两个数组记录行和列的信息。