forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSetMatrixZeroes.java
34 lines (30 loc) · 1.16 KB
/
SetMatrixZeroes.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
package com.stevesun.solutions;
/**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(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?
*/
public class SetMatrixZeroes {
//this is the most straightforward solution which uses O(mn) space
public void setZeroes(int[][] matrix) {
if(matrix == null || matrix.length == 0) return;
int height = matrix.length, width = matrix[0].length;
boolean[][] zero = new boolean[height][width];
for(int i = 0; i < height; i++){
for(int j = 0; j < width; j++){
if(matrix[i][j] == 0) zero[i][j] = true;
}
}
for(int i = 0; i < height; i++){
for(int j = 0; j < width; j++){
if(zero[i][j]){
for(int k = 0; k < height; k++) matrix[k][j] = 0;
for(int k = 0; k < width; k++) matrix[i][k] = 0;
}
}
}
}
}