zoukankan      html  css  js  c++  java
  • [LC] 819. Most Common Word

    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.

    class Solution {
        public String mostCommonWord(String paragraph, String[] banned) {
            Map<String, Integer> map = new HashMap<>();
            // same with [[a-zA-Z0-9_]+] or [ !?',;.]+
            String[] words = paragraph.toLowerCase().split("\W+");
            for (String str: words) {
                map.put(str, map.getOrDefault(str, 0) + 1);
            }
            for (String str: banned) {
                if (map.containsKey(str)) {
                    map.remove(str);            
                }
            }
            String res = null;
            int max = 0;
            for (Map.Entry<String, Integer> entry: map.entrySet()) {
                if (res == null || entry.getValue() > max) {
                    res = entry.getKey();
                    max = entry.getValue();
                }
            }
            return res;
        }
    }
  • 相关阅读:
    力扣(LeetCode)验证回文串 个人题解(C++)
    力扣(LeetCode)平方数之和 个人题解
    Exclusive Access 2 UVA
    C语言中指针*p[N], (*P)[N]的区别
    2018年蓝桥杯国赛比赛心得
    2018acm/icpc西安邀请赛比赛心得
    [最小割]Cable TV Network UVA
    Tree Reconstruction UVA
    Twenty Questions UVA
    python中的enumerate 函数(编号的实现方式)
  • 原文地址:https://www.cnblogs.com/xuanlu/p/12636310.html
Copyright © 2011-2022 走看看