forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRegions Cut By Slashes.java
82 lines (66 loc) · 2.06 KB
/
Regions Cut By Slashes.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
72
73
74
75
76
77
78
79
80
81
82
class Solution {
int[] parent;
int[] rank;
public int regionsBySlashes(String[] grid) {
parent = new int[4*grid.length*grid.length];
rank = new int[4*grid.length*grid.length];
for(int i=0;i<parent.length;i++){
parent[i] = i;
rank[i] = 0;
}
for(int i=0;i<grid.length;i++){
for(int j=0;j<grid[i].length();j++){
char ch = grid[i].charAt(j);
int bno = i * grid.length + j;
if(ch != '/'){
unionHelper(4*bno + 0 , 4*bno + 1);
unionHelper(4*bno + 2, 4*bno + 3);
}
if(ch != '\\'){
unionHelper(4*bno + 0 , 4*bno + 3);
unionHelper(4*bno + 1, 4*bno + 2);
}
if(i > 0){
int obno = (i-1) * grid.length + j;
unionHelper(4*bno + 0 , 4*obno + 2);
}
if(j > 0){
int obno = i * grid.length + (j-1);
unionHelper(4*bno + 3 , 4*obno + 1);
}
}
}
int count = 0;
for(int i=0;i<parent.length;i++){
if(parent[i] == i){
count++;
}
}
return count;
}
public int find(int x){
if(parent[x] == x){
return parent[x];
}else{
parent[x] = find(parent[x]);
return parent[x];
}
}
public void union(int xl,int yl){
if(rank[xl] < rank[yl]){
parent[xl] = yl;
}else if(rank[yl] < rank[xl]){
parent[yl] = xl;
}else{
parent[xl] = yl;
rank[yl]++;
}
}
public void unionHelper(int x,int y){
int xl = find(x);
int yl = find(y);
if(xl != yl){
union(xl,yl);
}
}
}