题目描述
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
click to show follow up.
Follow up:
Did you use extra space?
A straight forward solution using O(m n) 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后的行列又重新进行判断
解法有三:
1.可以判断后把0所在行列的值设为-1,二次遍历再设为0 时间复杂度会高 O(n^3),空间复杂度O(1)这是我们普遍想到的解法
2.用list集合储存设为0的行和列,二次遍历时再设为0,时间复杂度为O(n^2),但是因为用了集合,占用了空间,空间复杂度为O(n^2),这是平时做题不太难容易学习和应用的优化解法
import java.util.ArrayList;
public class Solution {
public void setZeroes(int[][] matrix) {
int row = matrix.length;
int col = matrix[0].length;
ArrayList<Integer> rows = new ArrayList<Integer>();
ArrayList<Integer> cols = new ArrayList<Integer>();
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
if(matrix[i][j]==0) {
//i行和j列都为0
rows.add(i);
cols.add(j);
}
}
}
for (Integer r : rows) {
for (int i = 0; i < col; i++) {
matrix[r][i] = 0;
}
}
for (Integer c : cols) {
for (int i = 0; i < row; i++) {
matrix[i][c] = 0;
}
}
}
}
3,把第一行和列的值先进行判断是否有0,并用bool值保存该状态,然后遍历1行1列后面的值,当发现0时,用第一行和第一列来保存行和列要设置的0值,二次遍历时判断第一行第一列的0值,将满足条件的1行1列后面的值变为0.最后再将bool值状态取出,如果为true,将第一行(列)的值便为0. 这是最优解法,它的时间复杂度是O(n^2),空间复杂度是O(1),是比较难想到和学会的。附上别人的代码:
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
const int row = matrix.size();
const int col = matrix[0].size();
bool row_flg = false, col_flg = false;
//判断第一行和第一列是否有零,防止被覆盖
for (int i = 0; i < row; i++)
if (0 == matrix[i][0]) {
col_flg = true;
break;
}
for (int i = 0; i < col; i++)
if (0 == matrix[0][i]) {
row_flg = true;
break;
}
//遍历矩阵,用第一行和第一列记录0的位置
for (int i = 1; i < row; i++)
for (int j = 1; j < col; j++)
if (0 == matrix[i][j]) {
matrix[i][0] = 0;
matrix[0][j] = 0;
}
//根据记录清零
for (int i = 1; i < row; i++)
for (int j = 1; j < col; j++)
if (0 == matrix[i][0] || 0 == matrix[0][j])
matrix[i][j] = 0;
//最后处理第一行
if (row_flg)
for (int i = 0; i < col; i++)
matrix[0][i] = 0;
if (col_flg)
for (int i = 0; i < row; i++)
matrix[i][0] = 0;
}
};