forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSet Matrix Zeroes.java
65 lines (54 loc) · 1.29 KB
/
Set Matrix Zeroes.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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
class Solution {
public void setZeroes(int[][] matrix) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0)
return;
int row = matrix.length;
int col = matrix[0].length;
boolean firstColumnZero = false;
boolean firstRowZero = false;
// Check if first column should be made zero
for (int i = 0; i < row; i++) {
if (matrix[i][0] == 0) {
firstColumnZero = true;
break;
}
}
// Check if first row should be made zero
for (int i = 0; i < col; i++) {
if (matrix[0][i] == 0) {
firstRowZero = true;
break;
}
}
// Traverse the matrix excluding first row and column
// If zero is found, update the same in first row and column
for (int i = 1; i < row; i++) {
for (int j = 1; j < col; j++) {
if (matrix[i][j] == 0) {
matrix[i][0] = 0;
matrix[0][j] = 0;
}
}
}
// Now traverse again and update
for (int i = 1; i < row; i++) {
for (int j = 1; j < col; j++) {
if (matrix[i][0] == 0 || matrix[0][j] == 0) {
matrix[i][j] = 0;
}
}
}
// Traverse and update first column
if (firstColumnZero) {
for (int i = 0; i < row; i++) {
matrix[i][0] = 0;
}
}
// Traverse and update first row
if (firstRowZero) {
for (int j = 0; j < col; j++) {
matrix[0][j] = 0;
}
}
}
}