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:
题意:将矩阵中元素为0的点的行和列置零,要求使用常量空间
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?
解法:将matrix[i][j]为0的matrix[i][0]和matrix[0][j]置零,用来记录需要置零的行和列;
特殊的是matrix[0][0],可能是matrix[0][j]上将它置零,也有可能是matrix[i][0]的元素将它置零,所以需要两个标志来判断
public class Solution {
public void setZeroes(int[][] matrix) {
int row = matrix.length;
if(row == 0) return ;
int col = matrix[0].length;
if(col == 0) return ;
boolean cF = false;
boolean rF = false;
for(int i=0; i<row; i++){
for(int j=0; j<col; j++){
if(matrix[i][j] == 0){
if(i == 0) rF = true;//需要将0列置零
if(j == 0) cF = true;//需要将0行置零
matrix[i][0] = 0;
matrix[0][j] = 0;
}
}
}
for(int i=1; i<row; i++){
if(matrix[i][0] == 0){
for(int j=0; j<col; j++)
matrix[i][j] = 0;
}
}
for(int j=1; j<col; j++){
if(matrix[0][j] == 0){
for(int i=0; i<row; i++)
matrix[i][j] = 0;
}
}
if(matrix[0][0] == 0){
if(cF)
for(int i=0; i<row; i++) matrix[i][0] = 0;
if(rF)
for(int j=0; j<col; j++) matrix[0][j] = 0;
}
}
}