-
Notifications
You must be signed in to change notification settings - Fork 154
/
sentence-similarity.js
77 lines (67 loc) · 2.12 KB
/
sentence-similarity.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/**
* 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].
*/
/**
* @param {string[]} words1
* @param {string[]} words2
* @param {string[][]} pairs
* @return {boolean}
*/
const areSentencesSimilar = (words1, words2, pairs) => {
if (!words1 && !words2) {
return true;
}
if (!words1 || !words2 || words1.length !== words2.length) {
return false;
}
const map = new Map();
for (let [s1, s2] of pairs) {
if (!map.has(s1)) {
map.set(s1, new Set());
}
map.get(s1).add(s2);
if (!map.has(s2)) {
map.set(s2, new Set());
}
map.get(s2).add(s1);
}
for (let i = 0; i < words1.length; i++) {
if (words1[i] === words2[i]) {
continue;
}
if (!map.has(words1[i])) {
return false;
}
if (!map.get(words1[i]).has(words2[i])) {
return false;
}
}
return true;
};
export { areSentencesSimilar };