-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
34 lines (29 loc) · 1.08 KB
/
Solution.java
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
class Solution {
public String mostCommonWord(String paragraph, String[] banned) {
Map<String, Integer> wordsMap = new HashMap<String, Integer>();
List<String> words = new ArrayList<String>();
String res = null;
int maxCount = 0;
paragraph = paragraph.toLowerCase();
paragraph = paragraph.replaceAll("[!?',;.]", "");
for (int i = 0; i < banned.length; i++) {
banned[i] = banned[i].toLowerCase();
}
for (String word : paragraph.split(" ")) {
if (wordsMap.get(word) == null) {
wordsMap.put(word, 1);
words.add(word);
} else {
wordsMap.put(word, wordsMap.get(word) + 1);
}
}
for (int i = 0; i < words.size(); i++) {
String word = words.get(i);
if (!Arrays.asList(banned).contains(word) && wordsMap.get(word) > maxCount) {
res = word;
maxCount = wordsMap.get(word);
}
}
return res;
}
}