-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathUnusualWordsInTwoSentences.java
More file actions
48 lines (43 loc) · 1.36 KB
/
UnusualWordsInTwoSentences.java
File metadata and controls
48 lines (43 loc) · 1.36 KB
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
package array_and_matrix;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
/**
* @Author: Wenhang Chen
* @Description:给定两个句子 A 和 B 。 (句子是一串由空格分隔的单词。每个单词仅由小写字母组成。)
*
* 如果一个单词在其中一个句子中只出现一次,在另一个句子中却没有出现,那么这个单词就是不常见的。
*
* 返回所有不常用单词的列表。
*
* 您可以按任何顺序返回列表。
*
*
*
* 示例 1:
*
* 输入:A = "this apple is sweet", B = "this apple is sour"
* 输出:["sweet","sour"]
* 示例 2:
*
* 输入:A = "apple apple", B = "banana"
* 输出:["banana"]
*
* @Date: Created in 20:51 6/30/2020
* @Modified by:
*/
public class UnusualWordsInTwoSentences {
public String[] uncommonFromSentences(String A, String B) {
Map<String, Integer> count = new HashMap();
for (String word : A.split(" "))
count.put(word, count.getOrDefault(word, 0) + 1);
for (String word : B.split(" "))
count.put(word, count.getOrDefault(word, 0) + 1);
List<String> ans = new LinkedList();
for (String word : count.keySet())
if (count.get(word) == 1)
ans.add(word);
return ans.toArray(new String[ans.size()]);
}
}