-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
547.java
83 lines (77 loc) · 2.3 KB
/
547.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
83
__________________________________________________________________________________________________
sample 1 ms submission
public class Solution {
class UnionFind {
private int count = 0;
private int[] parent, rank;
public UnionFind(int n) {
count = n;
parent = new int[n];
rank = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
}
}
public int find(int p) {
while (p != parent[p]) {
parent[p] = parent[parent[p]]; // path compression by halving
p = parent[p];
}
return p;
}
public void union(int p, int q) {
int rootP = find(p);
int rootQ = find(q);
if (rootP == rootQ) return;
if (rank[rootQ] > rank[rootP]) {
parent[rootP] = rootQ;
}
else {
parent[rootQ] = rootP;
if (rank[rootP] == rank[rootQ]) {
rank[rootP]++;
}
}
count--;
}
public int count() {
return count;
}
}
public int findCircleNum(int[][] M) {
int n = M.length;
UnionFind uf = new UnionFind(n);
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (M[i][j] == 1) uf.union(i, j);
}
}
return uf.count();
}
}
__________________________________________________________________________________________________
sample 38300 kb submission
class Solution {
public int findCircleNum(int[][] M) {
int n = M.length;
boolean[] visited = new boolean[n];
int res = 0;
for(int i=0;i<n;i++){
if(!visited[i]){
DFS(M,visited,i);
res++;
}
}
return res;
}
private void DFS(int[][] M,boolean[] visited,int i){
visited[i] = true;
for(int j=0;j<M.length;j++){
if(M[i][j]==1&&!visited[j]){
visited[j] = true;
DFS(M,visited,j);
}
}
}
}
__________________________________________________________________________________________________