leetcode 819. Most Common Word 最常见的单词 python 最简代码（3行） Counter()、lower()、字典反转

所有Leetcode题目不定期汇总在 Github, 欢迎大家批评指正，讨论交流。

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.

class Solution:
    def mostCommonWord(self, paragraph, banned):
        """
        :type paragraph: str
        :type banned: List[str]
        :rtype: str
        """
        # Approach #1
        # 1、转换大写字母为小写。
        # 2、按照空格切分单词。
        # 3、去除标点以及在banned中的词，构造新的列表。
        # 4、用Counter（）函数构造字典。
        # 5、字典反转。
        # 6、选取key最大的value。
        from collections import Counter  
        Adic = {v:k for k,v in Counter([i.strip('!?\',;.') for i in paragraph.lower().split(' ') if i.strip('!?\',;.') not in banned] ).items()}
        return Adic[max(Adic.keys())]

所有Leetcode题目不定期汇总在 Github, 欢迎大家批评指正，讨论交流。