-
Notifications
You must be signed in to change notification settings - Fork 25
/
0884-uncommon-words-from-two-sentences.js
51 lines (42 loc) · 1.33 KB
/
0884-uncommon-words-from-two-sentences.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
// 884. Uncommon Words from Two Sentences
// Easy 62%
// We are given two sentences A and B. (A sentence is a string of space
// separated words. Each word consists only of lowercase letters.)
// A word is uncommon if it appears exactly once in one of the sentences, and
// does not appear in the other sentence.
// Return a list of all uncommon words.
// You may return the list in any order.
// Example 1:
// Input: A = "this apple is sweet", B = "this apple is sour"
// Output: ["sweet","sour"]
// Example 2:
// Input: A = "apple apple", B = "banana"
// Output: ["banana"]
// Note:
// 0 <= A.length <= 200
// 0 <= B.length <= 200
// A and B both contain only spaces and lowercase letters.
/**
* @param {string} A
* @param {string} B
* @return {string[]}
*/
const uncommonFromSentences = function(A, B) {
const hash = {}
for (let w of (A + ' ' + B).split(' ')) hash[w] = (hash[w] || 0) + 1
const res = []
for (let key in hash) {
if (hash[key] === 1) res.push(key)
}
return res
}
;[
['this apple is sweet', 'this apple is sour'], // ['sweet', 'sour'],
['apple apple', 'banana'], // ['banana']
].forEach(([A, B]) => {
console.log(uncommonFromSentences(A, B))
})
// Solution:
// 用 hashMap 来记录 A 和 B 每个单词出现的次数,
// 次数为 1 的添加到答案中。
// Submission Result: Accepted