737. Sentence Similarity II

Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs, determine if two sentences are similar.

For example, words1 = ["great", "acting", "skills"] and words2 = ["fine", "drama", "talent"] are similar, if the similar word pairs are pairs = [["great", "good"], ["fine", "good"], ["acting","drama"], ["skills","talent"]].

Note that the similarity relation is transitive. For example, if "great" and "good" are similar, and "fine" and "good" are similar, then "great" and "fine" are similar.

Similarity is also symmetric. For example, "great" and "fine" being similar is the same as "fine" and "great" being similar.

Also, a word is always similar with itself. For example, the sentences words1 = ["great"], words2 = ["great"], pairs = [] are similar, even though there are no specified similar word pairs.

Finally, sentences can only be similar if they have the same number of words. So a sentence like words1 = ["great"] can never be similar to words2 = ["doubleplus","good"].

Note:

• The length of words1 and words2 will not exceed 1000.

• The length of pairs will not exceed 2000.

• The length of each pairs[i] will be 2.

• The length of each words[i] and pairs[i][j] will be in the range [1, 20].

// DFS
bool dfs(unordered_map<string, unordered_set<string> >& graph, const string& source, const string& target, unordered_set<string>& visited) {
    if (graph[source].count(target)) return true;
    if (!visited.count(source)) {
        visited.insert(source);
        for (const string& next : graph[source]) {
            if (!visited.count(next) && dfs(graph, next, target, visited)) return true;
        }
    }
    return false;
}
bool areSentencesSimilarTwo(vector<string>& words1, vector<string>& words2, vector<vector<string>>& pairs) {
    if (words1.size() != words2.size()) return false;
    unordered_map<string, unordered_set<string> > pair_mp;
    for (const vector<string>& pair : pairs) {
        pair_mp[pair[0]].insert(pair[1]);
        pair_mp[pair[1]].insert(pair[0]);
    }
    unordered_set<string> visited;
    for (size_t i = 0; i < words1.size(); ++i) {
        if (words1[i] == words2[i]) continue;
        visited.clear();
        if (!pair_mp.count(words1[i]) || !dfs(pair_mp, words1[i], words2[i], visited)) return false;
    }
    return true;
}

// Union-Find
string getRoot(unordered_map<string, string>& root_mp, unordered_map<string, size_t>& root_sz, const string& s) {
    if (!root_mp.count(s)) {
        root_mp[s] = s;
        root_sz[s] = 1;
    }
    return (root_mp[s] == s) ? s : (root_mp[s] = getRoot(root_mp, root_sz, root_mp[s]) );
}
bool areSentencesSimilarTwo(vector<string>& words1, vector<string>& words2, vector<vector<string>>& pairs) {
    if (words1.size() != words2.size()) return false;
    unordered_map<string, string> root_mp;
    unordered_map<string, size_t> root_sz;
    for (const vector<string>& pair : pairs) {
        string r1 = getRoot(root_mp, root_sz, pair[0]), r2 = getRoot(root_mp, root_sz, pair[1]);
        if (r1 == r2) continue;
        size_t &sz1 = root_sz[pair[0]], &sz2 = root_sz[pair[1]];
        if (sz1 > sz2) {
            root_mp[r2] = r1;
            sz1 += sz2;
        } else {
            root_mp[r1] = r2;
            sz2 += sz1;
        }
    }
    for (size_t i = 0; i < words1.size(); ++i) {
        if (words1[i] == words2[i]) continue;
        if (getRoot(root_mp, root_sz, words1[i]) != getRoot(root_mp, root_sz, words2[i])) return false;
    }
    return true;
}