zoukankan      html  css  js  c++  java
  • 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.
    

    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 !?',;.
    • There are no hyphens or hyphenated words.
    • Words only consist of letters, never apostrophes or other punctuation symbols.

    用split + 正则表达式把paragraph的单词分离再转成小写,用hashmap保存paragraph中的单词,遍历banned,在hashmap中去除相应key,最后找出hashmap中出现次数最多的key

    注意正则表达式的用法:

    [xyz]  字符集,匹配包含的任一字符

    +     一次或多次匹配前面的字符或子表达式

    time: O(P + B), space: O(P + B)  -- P: length of paragraph, B: length of banned

    class Solution {
        public String mostCommonWord(String paragraph, String[] banned) {
            String res = "";
            String[] words = paragraph.toLowerCase().split("[ !?',;.]+");
            HashMap<String, Integer> map = new HashMap<>();
            for(String word : words) {
                map.put(word, map.getOrDefault(word, 0) + 1);
            }
            for(String word : banned) {
                if(map.containsKey(word))
                    map.remove(word);
            }
            
            for(String word : map.keySet()) {
                System.out.println(word);
                if(res == "" || map.get(word) > map.get(res))
                    res = word;
            }
            return res;
        }
    }
  • 相关阅读:
    WAP协议研究笔记—彩信的传输
    应用程序重起自身等几则技巧
    谁妨碍了我们快乐
    国庆长假总结
    关于输入法的两个问题
    反刍
    为什么,一个思维方式的问题,一个习惯的问题,已经意识到了这一点,
    电影池子,
    幻想下,
    意识流,
  • 原文地址:https://www.cnblogs.com/fatttcat/p/10125646.html
Copyright © 2011-2022 走看看