class UnionFind {
Integer[] arr;
public UnionFind(int size) {
this.arr = new Integer[size];
for (int i = 1; i < arr.length; i++)
arr[i] = new Integer(i);
}
public int findRoot(int i) {
while (i != arr[i]) i = arr[i];
return i;
}
public void union(int a, int b) {
a = findRoot(a);
b = findRoot(b);
arr[a] = b;
}
}
【算法】并查集
猜你喜欢
转载自blog.csdn.net/HuaLingPiaoXue/article/details/84310515
今日推荐
周排行