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?
思路:
那就一步一步来。
方法一:O(m*n)的空间
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
int n, m;
if((m = matrix.size()) == 0 || (n = matrix[0].size()) == 0) return;
int a[m][n];
for(int i = 0; i < m; i++)
for(int j = 0; j < n; j++)
a[i][j] = matrix[i][j];
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
if(!matrix[i][j]){
for(int k = 0; k < m; k++) a[k][j] = 0;
for(int k = 0; k < n; k++) a[i][k] = 0;
}
}
}
for(int i = 0; i < m; i++)
for(int j = 0; j < n; j++)
matrix[i][j] = a[i][j];
}
};
方法二:O(m+n)的空间,用两个数组来记录哪些行列需要最后被清零。
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
int n, m;
if((m = matrix.size()) == 0 || (n = matrix[0].size()) == 0) return;
int r[m] = {0}, c[n] = {0};
for(int i = 0; i < m; i++)
for(int j = 0; j < n; j++)
if(!matrix[i][j])
r[i] = 1, c[j] = 1;
for(int i = 0; i < m; i++)
if(r[i])
for(int j = 0; j < n; j++)
matrix[i][j] = 0;
for(int j = 0; j < n; j++)
if(c[j])
for(int i = 0; i < m; i++)
matrix[i][j] = 0;
}
};
方法三:用常数空间来做。其实就是改进方法二,用矩阵自身的第一行、第一列来记录。需要特殊处理记录第一行、第一列是否出现0。因为我先清空列[1, n),再逆序清空行,所以只需要特殊记录第一列是否出现0。
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
int n, m;
if((m = matrix.size()) == 0 || (n = matrix[0].size()) == 0) return;
bool firstColHasZero = false;
for(int i = 0; i < m; i++){
if(!matrix[i][0]) firstColHasZero = true;
for(int j = 1; j < n; j++)
if(!matrix[i][j])
matrix[i][0] = matrix[0][j] = 0;
}
for(int j = 1; j < n; j++) // col (0, n)
if(!matrix[0][j])
for(int i = 1; i < m; i++)
matrix[i][j] = 0;
for(int i = 0; i < m; i++){ // row [0, m)
if(!matrix[i][0])
for(int j = 1; j < n; j++)
matrix[i][j] = 0;
if(firstColHasZero) matrix[i][0] = 0;
}
}
};