LeetCode-Most Common Word

最新推荐文章于 2020-09-13 09:19:51 发布

BeHelium

最新推荐文章于 2020-09-13 09:19:51 发布

阅读量155

点赞数

分类专栏： LeetCode 文章标签： LeetCode Java

本文链接：https://blog.csdn.net/qq_24133491/article/details/82862164

版权

LeetCode 专栏收录该内容

306 篇文章 0 订阅

订阅专栏

Description：
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.

Note:

1 <= paragraph.length <= 1000.
1 <= banned.length <= 100.
1 <= banned[i].length <= 10.
The answer is unique, and written in lowercase (even if its occurrences in paragraph may have uppercase symbols, and even if it is a proper noun.)
paragraph only consists of letters, spaces, or the punctuation symbols !?’,;.
Different words in paragraph are always separated by a space.
There are no hyphens or hyphenated words.
Words only consist of letters, never apostrophes or other punctuation symbols.

题意：给定一个字符串包含了许多单词，每个不同的单词由空格分割，单词之间或者单词之内可能会出现标点符号，现在要求返回出现次数最多的单词，并且这个单词不在给出的限制列表内；

解法：我们第一步要做的就是将给定的字符串分割为不同的单词；题目已经说明了每个不同的单词之间是用空格划分的；为了统计每个单词出现的次数，即判断这个单词是否在限制列表内，我们使用哈希表来存储；这里需要注意的是以空格划分单词，得到的单词可能末尾会有标点符号需要处理；

Java

class Solution {
    public String mostCommonWord(String paragraph, String[] banned) {
        String[] words = paragraph.toLowerCase().split("\u0020");
        int cnt = 0;
        String result = null;
        Map<String, Integer> table = new HashMap<>();
        Set<String> wordsBanned = new HashSet<>();
        for (String wordBanned : banned) {
        	wordsBanned.add(wordBanned);
        }
        for (String word : words) {
            if (!Character.isLetter(word.charAt(word.length() - 1))) word = word.substring(0, word.length() - 1);
        	if (wordsBanned.contains(word)) continue;
        	table.put(word, table.getOrDefault(word, 0) + 1);
        	if (table.get(word) > cnt) {
        		cnt = table.get(word);
        		result = word;
        	}
        }
        return  result;
    }
}