第一种 对于quick-find的算法实现 public class UF { private int[] id; private int count; public UF(int N) { count = N; id = new int[N]; for (int i = 0; i < N; i++) { id[i] = i; } } public int count(){ return count; } public boolean connected(int p,int q){ return find(p) == find(q); } //quick-find算法 public in...