public static class Node {
 // Node可以是任意的類型 int， String等等
 }

 public static class UnionFind {
 public HashMap<Node, Node> fatherMap; // 用來存放每個節(jié)點的頭節(jié)點
 public HashMap<Node, Integer> sizeMap; // 用來保存每個集合的大小

 public UnionFind() {
  fatherMap = new HashMap<Node, Node>();
  sizeMap = new HashMap<Node, Integer>();
 }

 public void makeSet(List<Node> nodes) {
  fatherMap.clear();
  sizeMap.clear();
  for (Node node : nodes) {
  fatherMap.put(node, node); // 每個節(jié)點單獨成為一個集合，頭節(jié)點指向自己
  sizeMap.put(node, 1); // 初始化時每個集合的大小為1
  }
 }

 private Node findHead(Node node) {
  Node father = fatherMap.get(node);
  while (father != node) {
  father = findHead(father); // 遞歸向上找
  }
  fatherMap.put(node, father); // 每次遞歸時都把每個節(jié)點的父節(jié)點直接指向頭節(jié)點
  return father;
 }

 public boolean isSameSet(Node aNode, Node bNode) {
  return findHead(aNode) == findHead(bNode);
 }

 public void union(Node aNode, Node bNode) {
  if (aNode == null || bNode == null) {
  return;
  }
  Node aHead = findHead(aNode);
  Node bHead = findHead(bNode);
  if (aHead != bHead) {
  int aSize = sizeMap.get(aHead);
  int bSize = sizeMap.get(bHead);
  if (aSize <= bSize) {
   fatherMap.put(aHead, bHead);
   sizeMap.put(bHead, aSize + bSize);
  } else {
   fatherMap.put(bHead, aHead);
   sizeMap.put(aHead, aSize + bSize);
  }
  }
 }
 }