题目描述:
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。
解题思路:
使用hashset保存元素为0的行和列的集合,然后分别将行和列的值置为0。
代码(java):
class Solution {
public void setZeroes(int[][] matrix) {
if(matrix.length==0)return;
HashSet<Integer> rows=new HashSet();
HashSet<Integer> cols=new HashSet();
for(int i=0;i<matrix.length;i++){
for(int j=0;j<matrix[0].length;j++){
if(matrix[i][j]==0){
rows.add(i);
cols.add(j);
}
}
}
for(int row:rows){
for(int j=0;j<matrix[row].length;j++){
matrix[row][j]=0;
}
}
for(int col:cols){
for(int j=0;j<matrix.length;j++){
matrix[j][col]=0;
}
}
return;
}
}