摘要: class Solution { int cnt=1; queue<int> q; string ans; map<string,char>m; public: typedef struct in { int son[128]; int fail; string strInfo; }in; void 阅读全文
posted @ 2020-07-27 15:23 阿破 阅读(124) 评论(0) 推荐(0)
摘要: int find(int i){ return f[i]==i?i:f[i]=find(f[i]); } int Union(int nd1,int nd2){ int a=find(nd1); int b=find(nd2); if(a==b) return 0; if(rank[a]<=rank 阅读全文
posted @ 2020-07-27 11:07 阿破 阅读(112) 评论(0) 推荐(0)