734. Sentence Similarity

We can represent a sentence as an array of words, for example, the sentence `"I am happy with leetcode"` can be represented as `arr = ["I","am",happy","with","leetcode"]`.

Given two sentences `sentence1` and `sentence2` each represented as a string array and given an array of string pairs `similarPairs` where `similarPairs[i] = [xi, yi]` indicates that the two words `xi` and `yi` are similar.

Return `true` if `sentence1` and `sentence2` are similar, or `false` if they are not similar.

Two sentences are similar if:

• They have the same length (i.e. the same number of words)
• `sentence1[i]` and `sentence2[i]` are similar.

Notice that a word is always similar to itself, also notice that the similarity relation is not transitive. For example, if the words `a` and `b` are similar and the words `b` and `c` are similar, `a` and `c` are not necessarily similar.

Example 1:

```Input: sentence1 = ["great","acting","skills"], sentence2 = ["fine","drama","talent"], similarPairs = [["great","fine"],["drama","acting"],["skills","talent"]]
Output: true
Explanation: The two sentences have the same length and each word i of sentence1 is also similar to the corresponding word in sentence2.
```

Example 2:

```Input: sentence1 = ["great"], sentence2 = ["great"], similarPairs = []
Output: true
Explanation: A word is similar to itself.
```

Example 3:

```Input: sentence1 = ["great"], sentence2 = ["doubleplus","good"], similarPairs = [["great","doubleplus"]]
Output: false
Explanation: As they don't have the same length, we return false.
```

Constraints:

• `1 <= sentence1.length, sentence2.length <= 1000`
• `1 <= sentence1[i].length, sentence2[i].length <= 20`
• `sentence1[i]` and `sentence2[i]` consist of lower-case and upper-case English letters.
• `0 <= similarPairs.length <= 1000`
• `similarPairs[i].length == 2`
• `1 <= xi.length, yi.length <= 20`
• `xi` and `yi` consist of lower-case and upper-case English letters.
• All the pairs `(xi, yi)` are distinct.

734. Sentence Similarity
``````struct Solution;

use std::collections::HashMap;
use std::collections::HashSet;

impl Solution {
fn are_sentences_similar(
words1: Vec<String>,
words2: Vec<String>,
pairs: Vec<Vec<String>>,
) -> bool {
let mut hm: HashMap<String, HashSet<String>> = HashMap::new();
for word in &words1 {
let e = hm.entry(word.to_string()).or_default();
e.insert(word.to_string());
}
for word in &words2 {
let e = hm.entry(word.to_string()).or_default();
e.insert(word.to_string());
}
for pair in &pairs {
let a = pair[0].to_string();
let b = pair[1].to_string();
let e = hm.entry(a.to_string()).or_default();
e.insert(b.to_string());
let e = hm.entry(b.to_string()).or_default();
e.insert(a.to_string());
}
let n = words1.len();
let m = words2.len();
if n != m {
return false;
}
for i in 0..n {
let set = &hm[&words1[i]];
if !set.contains(&words2[i]) {
return false;
}
}

true
}
}

#[test]
fn test() {
let words1: Vec<String> = vec_string!["an", "extraordinary", "meal"];
let words2: Vec<String> = vec_string!["one", "good", "dinner"];
let pairs: Vec<Vec<String>> = vec_vec_string![
["great", "good"],
["extraordinary", "good"],
["well", "good"],
["wonderful", "good"],
["excellent", "good"],
["fine", "good"],
["nice", "good"],
["any", "one"],
["some", "one"],
["unique", "one"],
["the", "one"],
["an", "one"],
["single", "one"],
["a", "one"],
["truck", "car"],
["wagon", "car"],
["automobile", "car"],
["auto", "car"],
["vehicle", "car"],
["entertain", "have"],
["drink", "have"],
["eat", "have"],
["take", "have"],
["fruits", "meal"],
["brunch", "meal"],
["breakfast", "meal"],
["food", "meal"],
["dinner", "meal"],
["super", "meal"],
["lunch", "meal"],
["possess", "own"],
["keep", "own"],
["have", "own"],
["extremely", "very"],
["actually", "very"],
["really", "very"],
["super", "very"]
];
assert_eq!(Solution::are_sentences_similar(words1, words2, pairs), true);
}
``````