Description:

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"].

Link:

https://leetcode.com/problems/sentence-similarity-ii/description/

解题方法：

Union FInd

Time Complexity：

O(n)

完整代码：

class Node {
public: 
    int level;
    Node* father;
    Node() {level = 1; father = this;}
    Node* findAncestor() {
        if(this->father == this)
            return this;
        this->father = this->father->findAncestor();
        return this->father;
    }
};
bool areSentencesSimilarTwo(vector<string>& words1, vector<string>& words2, vector<pair<string, string>> pairs) {
    int size1 = words1.size();
    int size2 = words2.size();
    if(size1 != size2)
        return false;
    unordered_map<string, Node*> uf;
    for(int i = 0; i < pairs.size(); i++) {
        Node* acst1, * acst2;
        if(uf.find(pairs[i].first) != uf.end())
            acst1 = uf[pairs[i].first]->findAncestor();
        else {
            acst1 = new Node();
            uf[pairs[i].first] = acst1;
        }
        if(uf.find(pairs[i].second) != uf.end())
            acst2 = uf[pairs[i].second]->findAncestor();
        else {
            acst2 = new Node();
            uf[pairs[i].second] = acst2;
        }
        if(acst1->level > acst2->level)
            acst2->father = acst1;
        else if(acst1->level < acst2->level)
            acst1->father = acst2;
        else {
            acst2->father = acst1;
            acst1->level += acst2->level;
        }
    }
    for(int i = 0; i < size1; i++) {
        if(words1[i] != words2[i] && (uf.find(words1[i]) == uf.end() || uf.find(words2[i]) == uf.end() || uf[words1[i]]->findAncestor() != uf[words2[i]]->findAncestor()))
            return false;
    }
    return true;
}