-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathset_matrix_zeros.cpp
55 lines (51 loc) · 1.46 KB
/
set_matrix_zeros.cpp
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
class Solution {
public:
void setZeroes(vector<vector<int>>& matrix) {
if (!matrix.size())
return;
int m = matrix.size(), n = matrix[0].size();
bool isColumn = false, isRow = false;
// check if the index does have a zero or not
for (int i=0; i<m; i++) {
if (matrix[i][0] == 0) {
isColumn = true;
break;
}
}
for (int j=0; j<n; j++) {
if (matrix[0][j] == 0) {
isRow = true;
break;
}
}
// scan and place all the zeros in column and row
for (int i=1; i<m; i++) {
for (int j=1; j<n; j++) {
if (matrix[i][j] == 0) {
matrix[0][j] = 0;
matrix[i][0] = 0;
}
}
}
//Fill all the booleans with respected values
for (int i=1; i<m; i++) {
if (matrix[i][0] == 0) {
for (int j=1; j<n; j++) {
matrix[i][j] = 0;
}
}
}
for (int j = 1; j<n; j++) {
if (matrix[0][j] == 0) {
for (int i=1; i<m; i++) {
matrix[i][j]=0;
}
}
}
if (isRow) {
for (int j=0; j<n; j++) matrix[0][j] = 0;
}
if (isColumn)
for (int i=0; i<m; i++) matrix[i][0] = 0;
}
};