-
Notifications
You must be signed in to change notification settings - Fork 40
/
Copy pathUncommonWordsFromTwoSentences.js
52 lines (48 loc) · 1.38 KB
/
UncommonWordsFromTwoSentences.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
// Source : https://leetcode.com/problems/uncommon-words-from-two-sentences
// Author : Dean Shi
// Date : 2018-08-13
/***************************************************************************************
* 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[]}
*/
var uncommonFromSentences = function(A, B) {
const wordList = A.split(' ').concat(B.split(' '))
const table = {}
wordList.forEach((word) => {
if (table[word]) ++table[word]
else table[word] = 1
})
return Object
.entries(table)
.filter(([word, count]) => count === 1 && word !== '')
.map(([word]) => word)
};