Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at least one word that isn’t banned, and that the answer is unique.
Words in the list of banned words are given in lowercase, and free of punctuation. Words in the paragraph are not case sensitive. The answer is in lowercase.
Example:
Input:
paragraph = "Bob hit a ball, the hit BALL flew far after it was hit."
banned = ["hit"]
Output: "ball"
Explanation:
"hit" occurs 3 times, but it is a banned word.
"ball" occurs twice (and no other word does), so it is the most frequent non-banned word in the paragraph.
Note that words in the paragraph are not case sensitive,
that punctuation is ignored (even if adjacent to words, such as "ball,"),
and that "hit" isn't the answer even though it occurs more because it is banned.
使用set来存储ban掉的词汇,使用map存词汇对应出现频率。
维护一个最大的freq,不断更新,最后根据这个maxFreq,得到map中对应的key
注意: paragraph中可能有标点符号,使用正则表达式分割出来词汇。
class Solution {
public String mostCommonWord(String paragraph, String[] banned) {
String[] words = paragraph.toLowerCase().split("\\W+");
Set<String> ban = new HashSet<>();
Map<String, Integer> map = new HashMap<>();
int maxFreq = 0;
for (String s : banned) {
ban.add(s);
}
for (String word : words) {
if (!ban.contains(word)) {
if (!map.containsKey(word)) {
map.put(word, 1);
} else {
map.put(word, map.get(word) + 1);
}
maxFreq = Math.max(maxFreq, map.get(word));
}
}
for (String key : map.keySet()) {
if (map.get(key) == maxFreq) {
return key;
}
}
return null;
}
}