题目:
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 所在的行和列都设置为 0 ,要求空间复杂度为常数级别
分析:
最容易想到的方法是空间复杂度为O(m+n),见代码一,
尝试想想常数空间复杂度的解法...
暂时没有结果,后边再看吧
代码:(空间复杂度为O(m+n))
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
int n = matrix.size();
if (!n) {
return ;
}
int m = matrix[0].size();
if (!m) {
return ;
}
vector<bool> row(n, false);
vector<bool> column(m, false);
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < m; ++ j) {
if (!matrix[i][j]) {
row[i] = true;
column[j] = true;
}
}
}
for (int i = 0; i < n; ++ i) {
for (int j = 0; j < m; ++ j) {
if (row[i] || column[j]) {
matrix[i][j] = 0;
}
}
}
}
};
代码二:(空间复杂度O(1))
未完待续