值为v的数封为Node型的节点，除了nodes中保存了V和Node的对应关系外，并查集相关的parents，sizeMap都是用Node来关联的。
#include<iostream>
#include<map>
#include<vector>
#include<stack>
using namespace std;typedef int V;struct Node{V value;Node(V v){this->value = v;}
};class UnionFind
{
private:map<V,Node*> nodes;map<Node*, Node*>parents;map<Node*, int>sizeMap;public:UnionFind(vector<V> values){//初始化成员信息for(V v: values){Node *node = new Node(v);nodes[v]= node;parents[node] = node;sizeMap[node] = 1;}}~UnionFind(){for(auto p:nodes){delete p.second;p.second = nullptr;}}//给你一个节点,找到该节点的父节点Node* findFather(Node* cur){stack<Node *>path;while(cur != parents[cur]){path.push(cur);cur = parents[cur];}while(!path.empty()){parents[path.top()] = cur;path.pop();}return cur;}//判断2个节点是否属于同一集合bool isSameSet(V a, V b){Node *aNode = nodes[a];Node *bNode = nodes[b];return findFather(aNode) == findFather(bNode);}//将2个集合合并为一个集合void Union(V a, V b){Node *aFather = findFather(nodes[a]);Node *bFather = findFather(nodes[b]);if(aFather != bFather){int aSize = sizeMap[aFather];int bSize = sizeMap[bFather];Node *big = aSize>=bSize? aFather:bFather;Node *small = big==aFather?bFather:aFather;parents[small] = big;sizeMap[big] += aSize + bSize;sizeMap.erase(small);}}//返回集合的总数int nums(){return sizeMap.size();}
};int main()
{system("pause");return 0;
}
)
