-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
44 lines (40 loc) · 1.13 KB
/
Main.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
package com.company;
public class Main {
public static void main(String[] args) {
// write your code here
}
int[] parent;
int[] rank;
public int findCircleNum(int[][] isConnected) {
int cities = isConnected.length;
parent = new int[cities];
for(int i = 0; i < cities; i++)
parent[i] = i;
rank = new int[cities];
for(int i = 0; i < isConnected.length; i++){
for (int j = i + 1; j < isConnected.length; j++){
if(isConnected[i][j] == 0) continue;
if(union(i, j))
cities--;
}
}
return cities;
}
public int find(int x){
if(parent[x] != x)
parent[x] = find(parent[x]);
return parent[x];
}
public Boolean union(int x, int y){
int rootX = find(x), rootY = find(y);
if(rootX == rootY) return false;
if(rank[rootX] >= rank[rootY]){
parent[rootY] = rootX;
if(rank[rootX] == rank[rootY])
rank[rootX]++;
}
else
parent[rootX] = rootY;
return true;
}
}