-
Notifications
You must be signed in to change notification settings - Fork 0
/
Leetcode0073.java
71 lines (58 loc) · 1.15 KB
/
Leetcode0073.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
66
67
68
69
70
71
/**
* Created by dezhonger on 2017/2/15.
* 先判断第一列和第一行有没有零。
* 然后用第一列和第一行来辅助记录数据.
*/
public class Leetcode073 {
public void setZeroes(int[][] matrix) {
int m = matrix.length;
int n = matrix[0].length;
int col = 1;
int row = 1;
for(int i = 0; i < m; i++) {
if(matrix[i][0] == 0) {
col = 0;
}
}
for(int j = 0; j < n; j++) {
if(matrix[0][j] == 0) {
row = 0;
}
}
for(int i = 1; i < m; i++) {
for(int j = 1; j < n; j++) {
int x = matrix[i][j];
if(x == 0) {
matrix[0][j] = matrix[i][0] = 0;
}
}
}
for(int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
if(matrix[0][j] == 0 || matrix[i][0] == 0) {
matrix[i][j] = 0;
}
}
}
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(col == 0) {
for(int i = 0; i < m; i++) {
matrix[i][0] = 0;
}
}
if(row == 0) {
for(int j = 0; j < n; j++) {
matrix[0][j] = 0;
}
}
}
}