ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

[Google] LeetCode 839 Similar String Groups 并查集

2022-09-12 17:35:02  阅读:279  来源: 互联网

标签:sz strs Google String int 查集 fa similar string


Two strings X and Y are similar if we can swap two letters (in different positions) of X, so that it equals Y. Also two strings X and Y are similar if they are equal.

For example, "tars" and "rats" are similar (swapping at positions 0 and 2), and "rats" and "arts" are similar, but "star" is not similar to "tars", "rats", or "arts".

Together, these form two connected groups by similarity: {"tars", "rats", "arts"} and {"star"}. Notice that "tars" and "arts" are in the same group even though they are not similar. Formally, each group is such that a word is in the group if and only if it is similar to at least one other word in the group.

We are given a list strs of strings where every string in strs is an anagram of every other string in strs. How many groups are there?

Solution

可以交换两个字符的可以归为一类,所以我们可以维护一个并查集,当然此时我们用 \(unordered\_map\) 来维护父节点. 最后只需要统计多少个

\[fa[x]=x \]

点击查看代码
class Solution {
private:
    bool check(string& a, string& b){
        int cnt=0;
        int l = a.size();
        for(int i=0;i<l;i++){
            cnt += (a[i]!=b[i]);
        }
        return cnt==0 || cnt==2;
    }
    
    unordered_map<string,string> fa;
    unordered_map<string,int> sz;
    
    string find(string s, unordered_map<string,string>& fa){
        if(s==fa[s])return s;
        return fa[s] = find(fa[s], fa);
    }
    
    void join(string u, string v,unordered_map<string,string>&fa, unordered_map<string,int>& sz){
        u = find(u, fa); v = find(v, fa);
        if(sz[u]>sz[v])fa[v]=u;
        else if(sz[v]>sz[u])fa[u]=v;
        else {fa[v]=u;sz[u]++;}
    }
    
    int ans=0;
public:
    int numSimilarGroups(vector<string>& strs) {
        int n = strs.size();
        int l = strs[0].size();
        for(int i=0;i<n;i++){
            fa[strs[i]] = strs[i];
            sz[strs[i]]=0;
        }
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                if(check(strs[i], strs[j])){
                    join(strs[i], strs[j], fa, sz);
                }
            }
        }
        for(auto ele: fa){
            if(ele.first ==ele.second)ans++;
        }
        return ans;
    }
};

标签:sz,strs,Google,String,int,查集,fa,similar,string
来源: https://www.cnblogs.com/xinyu04/p/16686691.html

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有