博客
关于我
LeetCode Most Common Word 最常见的词
阅读量:801 次
发布时间:2023-01-31

本文共 3035 字,大约阅读时间需要 10 分钟。

Here is an optimized version of the thought process and solution:

  • Data Preparation

    • Convert the entire paragraph to lowercase to handle case insensitivity.
    • Remove all punctuation marks (such as commas, periods, exclamation points, etc.) to isolate words.
    • Ensure words are properly separated by spaces to avoid partial words (e.g., "ball," becomes "ball").
  • Word Frequency Calculation

    • Traverse the prepared string, extracting each word by ignoring punctuation and case differences.
    • Use a hash map (dictionary) to count occurrences of each word.
    • For each character in the paragraph: If it's a letter, add it to the current word being built. If it's not a letter or reaches the end of the string, finalize the word and update its count in the hash map.
  • Filter Banned Words

    • Store banned words in a set for quick lookup.
    • Iterate through the hash map to exclude any words that exist in the banned set, keeping only valid words.
  • Determine Most Frequent Word

    • Sort the remaining words by their frequency in descending order.
    • Return the first word in this sorted list, as it by definition is unique and has the highest count according to the problem constraints.
  • Final Solution Code

    import java.util.HashMap;import java.util.HashSet;import java.util.Map;public class Solution {    public String mostCommonWord(String paragraph, String[] banned) {        // Convert paragraph to lowercase and remove punctuation        StringBuilder cleanParagraph = new StringBuilder();        for (char c : paragraph.toCharArray()) {            if (c >= 'a' && c <= 'z') {                cleanParagraph.append(c);            }        }        // Split into words        String[] words = cleanParagraph.toString().split(" +");        // Count frequency of each word        Map
    frequencyMap = new HashMap<>(); for (String word : words) { frequencyMap.put(word, frequencyMap.getOrDefault(word, 0) + 1); } // Create banned words set for quick lookup HashSet
    bannedWords = new HashSet<>(); for (String bw : banned) { bannedWords.add(bw.toLowerCase()); } // Exclude banned words and find the most frequent int maxCount = -1; String result = ""; for (Map.Entry
    entry : frequencyMap.entrySet()) { if (!bannedWords.contains(entry.getKey())) { if (entry.getValue() > maxCount) { maxCount = entry.getValue(); result = entry.getKey(); } } } return result; }}

    Explanation

    • The code first processes the input paragraph to remove punctuation and convert it to lowercase, ensuring uniformity in word processing.
    • It then splits the cleaned string into individual words and uses a hash map to count each word's occurrences.
    • Banned words are stored in a set for quick exclusion.
    • Finally, the code iterates through the frequency map, excluding banned words, and identifies the word with the highest count, which is then returned as the result.

    转载地址:http://oogyk.baihongyu.com/

    你可能感兴趣的文章
    mariadb multi-source replication(mariadb多主复制)
    查看>>
    MaterialForm对tab页进行隐藏
    查看>>
    Member var and Static var.
    查看>>
    memcached高速缓存学习笔记001---memcached介绍和安装以及基本使用
    查看>>
    memcached高速缓存学习笔记003---利用JAVA程序操作memcached crud操作
    查看>>
    Memcached:Node.js 高性能缓存解决方案
    查看>>
    memcache、redis原理对比
    查看>>
    memset初始化高维数组为-1/0
    查看>>
    Metasploit CGI网关接口渗透测试实战
    查看>>
    Metasploit Web服务器渗透测试实战
    查看>>
    Moment.js常见用法总结
    查看>>
    MongoDB出现Error parsing command line: unrecognised option ‘--fork‘ 的解决方法
    查看>>
    MongoDB学习笔记(8)--索引及优化索引
    查看>>
    ms sql server 2008 sp2更新异常
    查看>>
    MS UC 2013-0-Prepare Tool
    查看>>
    msbuild发布web应用程序
    查看>>
    MSCRM调用外部JS文件
    查看>>
    MSEdgeDriver (Chromium) 不适用于版本 >= 79.0.313 (Canary)
    查看>>
    msf
    查看>>
    MSSQL数据库查询优化(一)
    查看>>