-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path01Matrix.java
More file actions
85 lines (71 loc) · 2.34 KB
/
Copy path01Matrix.java
File metadata and controls
85 lines (71 loc) · 2.34 KB
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
class Solution {
public int[][] updateMatrix(int[][] A) {
if(A == null || A.length == 0) return A;
int m = A.length;
int n = A[0].length;
for(int i = 0; i < m; i++) {
for(int j = 0; j < n; j++) {
if(A[i][j] == 0) {}
else {
if(hasZero(A, i, j)) A[i][j] = 1;
else A[i][j] = Math.min(lv(A,i,j-1), lv(A,i-1,j))+1;
}
}
}
for(int i = m-1; i >= 0; i--) {
for(int j = n-1; j >= 0; j--) {
if(A[i][j] == 0) {}
else {
if(hasZero(A, i, j)) A[i][j] = 1;
else A[i][j] = Math.min(A[i][j], Math.min(lv(A,i,j+1), lv(A,i+1,j))+1);
}
}
}
return A;
}
private int lv(int[][] A, int i, int j) {
if(i < 0 || i >= A.length) return 10000;
if(j < 0 || j >= A[0].length) return 10000;
return A[i][j];
}
private boolean hasZero(int[][]A, int i, int j) {
if (lm(A, i, j-1) || lm(A, i-1, j) || lm(A, i, j+1) || lm(A, i+1, j)) return true;
return false;
}
private boolean lm(int[][] A, int i, int j) {
if(i < 0 || i >= A.length) return false;
if(j < 0 || j >= A[0].length) return false;
if(A[i][j] == 0) return true;
return false;
}
}
// Approach #2: improved version
class Solution {
public int[][] updateMatrix(int[][] A) {
if(A == null || A.length == 0) return A;
int m = A.length;
int n = A[0].length;
for(int i = 0; i < m; i++) {
for(int j = 0; j < n; j++) {
if(A[i][j] == 0) {}
else {
A[i][j] = Math.min(lv(A,i,j-1), lv(A,i-1,j))+1;
}
}
}
for(int i = m-1; i >= 0; i--) {
for(int j = n-1; j >= 0; j--) {
if(A[i][j] == 0) {}
else {
A[i][j] = Math.min(A[i][j], Math.min(lv(A,i,j+1), lv(A,i+1,j))+1);
}
}
}
return A;
}
private int lv(int[][] A, int i, int j) {
if(i < 0 || i >= A.length) return 10000;
if(j < 0 || j >= A[0].length) return 10000;
return A[i][j];
}
}