力扣剑指offer2第40天图

117）相似的字符串

class Solution {
public:
    vector<int> f;
    int find(int x){
        return f[x]==x ? x : find(f[x]);
    }
    bool check(string &a, string &b, int len){
        int num = 0;
        for(int i=0; i<len; i++){
            if(a[i] != b[i]) num++;
            if(num>2) return false;
        }
        return true;
    }
    int numSimilarGroups(vector<string>& strs) {
        int m=strs.size(), n=strs[0].length();
        f.resize(m);
        for(int i=0; i<m; i++) f[i] = i;
        for(int i=0; i<m; i++){
            for(int j=i+1; j<m; j++){
                int fi=find(i), fj=find(j);
                if(fi==fj) continue;
                if(check(strs[i], strs[j], n)) f[fi] = fj;
            }
        }
        int ret=0;
        for(int i=0; i<m; i++){
            if(f[i]==i) ret++;
        }
        return ret;
    }
};

118)冗余连接

class Solution {
public:
    vector<int> findRedundantConnection(vector<vector<int>>& edges) {
        int n = edges.size();
        vector<int> parent(n+1);
        for(int i=1; i<=n; i++) parent[i] = i;
        for(auto &edge : edges){
            int node1=edge[0], node2=edge[1];
            if(Find(parent, node1) != Find(parent, node2)){
                Union(parent, node1, node2);
            }else return edge;
        }
        return vector<int>{};
    }
    int Find(vector<int>& parent, int node){
        return parent[node]==node ? node : Find(parent, parent[node]);
    }
    void Union(vector<int>& parent, int node1, int node2){
        parent[Find(parent, node1)] = Find(parent, node2);
    }
};

119)最长连续序列

class Solution {
public:
    int longestConsecutive(vector<int>& nums) {
        unordered_set<int> num_set;
        for(int num : nums) num_set.insert(num);
        int longestStreak = 0;

        for(const int &num:num_set){
            if(!num_set.count(num-1)){
                int currentStreak = 1;
                int currentNum = num;
                while(num_set.count(currentNum+1)){
                    currentNum++;
                    currentStreak++;
                }
                longestStreak = max(longestStreak, currentStreak);
            }
        }
        return longestStreak;
    }
};