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:
words1
and words2
will not exceed 1000
.pairs
will not exceed 2000
.pairs[i]
will be 2
.words[i]
and pairs[i][j]
will be in the range [1, 20]
.class Solution { public boolean areSentencesSimilar(String[] words1, String[] words2, String[][] pairs) { if (words1.length != words2.length) return false; Map<String, Set<String>> map = new HashMap<>(); for (String[] s : pairs) { if (!map.containsKey(s[0])) map.put(s[0], new HashSet<String>()); if (!map.containsKey(s[1])) map.put(s[1], new HashSet<String>()); map.get(s[0]).add(s[1]); map.get(s[1]).add(s[0]); } for (int i = 0; i < words1.length; i++) { String w1 = words1[i], w2 = words2[i]; if (w1.equals(w2) || (map.containsKey(w1) && map.get(w1).contains(w2)) || (map.containsKey(w2) && map.get(w2).contains(w1))) continue; return false; } return true; } }
No comments:
Post a Comment