LeetCode 734. Sentence Similarity

原题链接在这里：https://leetcode.com/problems/sentence-similarity/

题目：

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, "great acting skills" and "fine drama talent" are similar, if the similar word pairs are pairs = [["great", "fine"], ["acting","drama"], ["skills","talent"]].

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

However, similarity is 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].

题解：

In order to maintain symmetric, check the word combination left ^ right, and right ^ left to see if it is in the set.

Time Complexity: O(m+n). m = words1.length. n = pairs.size().

Space: O(n).

AC Java: 

class Solution {
    public boolean areSentencesSimilar(String[] words1, String[] words2, List<List<String>> pairs) {
        if(words1 == null && words2 == null){
            return true;
        }
        
        if(words1 == null || words2 == null || words1.length != words2.length){
            return false;
        }
        
        HashSet<String> hs = new HashSet<String>();
        for(List<String> pair : pairs){
            hs.add(pair.get(0) + "^" + pair.get(1));
        }
        
        for(int i = 0; i<words1.length; i++){
            if(words1[i].equals(words2[i]) ||
              hs.contains(words1[i]+"^"+words2[i]) || 
              hs.contains(words2[i]+"^"+words1[i])){
                continue;
            }
            
            return false;
        }
        
        return true;
    }
}

类似Sentence Similarity II.