819. Most Common Word*

819. Most Common Word*

https://leetcode.com/problems/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.
• 0 <= 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.

C++ 实现 1

使用哈希表. 这道题的一个要点: 给定了一个统计了 word 的哈希表, 如果找出其中的 word 个数最大值.
我一开始用最大堆… 但实际上可以用遍历哈希表解决.

另外, 这道题的一个陷阱是对 paragraph 的整理, 用 stringstream 可以方便的处理空格, 但是测试用例中存在 a a b,b,b, a 这样的 paragraph, 不容易处理其中的逗号. 一个特别简单的解决方法是(参考 [C++/Java/Python] Easy Solution with Explanation) : 将不是字母的符号替换成空格.

class Solution {
private:
    struct Comp {
        bool operator()(const pair<string, int> &p, const pair<string, int> &q) {
            return p.second < q.second;
        }  
    };
public:
    string mostCommonWord(string paragraph, vector<string>& banned) {
        unordered_set<string> record;
        unordered_map<string, int> freq;
        for (auto &s : banned) record.insert(s);
        for (auto &c: paragraph) c = isalpha(c) ? tolower(c) : ' ';
        stringstream ss(paragraph);
        string word;
        pair<string, int> res("", 0);
        while (ss >> word)
            if (!record.count(word) && ++freq[word] > res.second)
                res = make_pair(word, freq[word]);
        return res.first;
    }
};

C++ 实现 2

最大堆的使用, 为了求哈希表中的最大值.

class Solution {
private:
    struct Comp {
        bool operator()(const pair<string, int> &p, const pair<string, int> &q) {
            return p.second < q.second;
        }  
    };
public:
    string mostCommonWord(string paragraph, vector<string>& banned) {
        unordered_set<string> record;
        unordered_map<string, int> freq;
        priority_queue<pair<string, int>, vector<pair<string, int>>, Comp> max_heap;
        string word;
        for (auto &s : banned) record.insert(s);
        for (auto &c: paragraph) c = isalpha(c) ? tolower(c) : ' ';
        stringstream ss(paragraph);
        while (ss >> word)
            freq[word] += 1;
        for (auto &p : freq) max_heap.push(p);
        string res;
        while (!max_heap.empty()) {
            auto p = max_heap.top();
            max_heap.pop();
            if (!record.count(p.first)) {
                res = p.first;
                break;
            }
        }
        return res;
    }
};