Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.
Example 1:
Input: [ [1,1,1], [1,0,1], [1,1,1] ] Output: [ [1,0,1], [0,0,0], [1,0,1] ]
Example 2:
Input: [ [0,1,2,0], [3,4,5,2], [1,3,1,5] ] Output: [ [0,0,0,0], [0,4,5,0], [0,3,1,0] ]
Follow up:
- 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则将该元素所在的行和列都设为0。
设置两个vector,记录设置行和列设置为0的位置,这样做的存储空间是m+n,可以将设置为0的下标记录在第一行和第一列,这样就不需要额外空间了。
O(m+n):
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
vector<int> r,c;
vector<int>::iterator it;
for(int i=0;i<matrix.size();i++)
for(int j=0;j<matrix[0].size();j++){
if(matrix[i][j]==0){
if((!r.empty() && i!=r.back()) || r.empty()) r.push_back(i);
it=find(c.begin(),c.end(),j);
if(it==c.end()) c.push_back(j);
}
}
for(int i=0;i<r.size();i++){
matrix[r[i]]=vector<int>(matrix[0].size(), 0);
}
for(int j=0;j<c.size();j++){
for(int i=0;i<matrix.size();i++)
matrix[i][c[j]]=0;
}
}
};
。。。。待续