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

思路：就是个union find

class Solution {
    private class UnionFind {
        public int[] father;
        public int count;
        
        public UnionFind(int n) {
            this.father = new int[n+1];
            for(int i = 0; i <= n; i++) {
                father[i] = i;
            }
        }
        
        public int find(int x) {
            int j = x;
            while(father[j] != j) {
                j = father[j];
            }
            
            // path compression;
            while(x != j) {
                int fx = father[x];
                father[x] = j;
                x = fx;
            }
            
            return j;
        }
        
        public void union(int a, int b) {
            int root_a = find(a);
            int root_b = find(b);
            if(root_a != root_b) {
                father[root_a] = root_b;
                count--;
            }
        }
    }
    
    public boolean areSentencesSimilarTwo(String[] words1, String[] words2, List<List<String>> pairs) {
        if(words1 == null || words2 == null || pairs == null) {
            return false;
        }
        if(words1.length != words2.length) {
            return false;
        }
        
        HashSet<String> set = new HashSet<String>();
        for(String word: words1) {
            set.add(word);
        }
        for(String word: words2) {
            set.add(word);
        }
        
        for(List<String> pair: pairs) {
            String from = pair.get(0);
            String to = pair.get(1);
            set.add(from);
            set.add(to);
        }
         
        int index = 0;
        HashMap<String, Integer> hashmap = new HashMap<String, Integer>();
        for(String str: set) {
            hashmap.put(str, index++);
        }
        
        int n = set.size();
        UnionFind uf = new UnionFind(n);
        for(List<String> pair: pairs) {
            String from = pair.get(0);
            String to = pair.get(1);
            uf.union(hashmap.get(from), hashmap.get(to));
        }
        
        for(int i = 0; i < words1.length; i++) {
            if(uf.find(hashmap.get(words1[i])) != uf.find(hashmap.get(words2[i]))) {
                return false;
            }
        }
        return true;
    }
}