C#LeetCode刷题之#819-最常见的单词(Most Common Word)

C#LeetCode刷题之#819-最常见的单词(Most Common Word)

问题

给定一个段落 (paragraph) 和一个禁用单词列表 (banned)。返回出现次数最多,同时不在禁用列表中的单词。题目保证至少有一个词不在禁用列表中,而且答案唯一。

禁用列表中的单词用小写字母表示,不含标点符号。段落中的单词不区分大小写。答案都是小写字母。

输入: paragraph = “Bob hit a ball, the hit BALL flew far after it was hit.” banned = [“hit”]

输出: “ball”

解释: “hit” 出现了3次,但它是一个禁用的单词。”ball” 出现了2次 (同时没有其他单词出现2次),所以它是段落里出现次数最多的,且不在禁用列表中的单词。 注意,所有这些单词在段落里不区分大小写,标点符号需要忽略(即使是紧挨着单词也忽略, 比如 “ball,”), “hit”不是最终的答案,虽然它出现次数更多,但它在禁用单词列表中。

说明:

  • 1 <= 段落长度 <= 1000.
  • 1 <= 禁用单词个数 <= 100.
  • 1 <= 禁用单词长度 <= 10.
  • 答案是唯一的, 且都是小写字母 (即使在 paragraph 里是大写的,即使是一些特定的名词,答案都是小写的。)
  • paragraph 只包含字母、空格和下列标点符号!?’,;.
  • 不存在没有连字符或者带有连字符的单词。
  • 单词里只包含字母,不会出现省略号或者其他标点符号。

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.

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.

示例

public class Program {

    public static void Main(string[] args) {
        var paragraph = "Bob. hIt, baLl";
        var banned = new string[] { "bob", "hit" };

        var res = MostCommonWord(paragraph, banned);
        Console.WriteLine(res);

        Console.ReadKey();
    }

    private static string MostCommonWord(string paragraph, string[] banned) {
        //转小写后,过滤非字符
        //也可按题目给定的 !? ',;. 为非字符进行判定
        var sb = new StringBuilder(paragraph.ToLower());
        for(var i = 0; i < sb.Length; i++) {
            if(!(sb[i] >= 'a' && sb[i] <= 'z') && !(sb[i] >= 'A' && sb[i] <= 'Z')) {
                sb[i] = ' ';
            }
        }
        //用字典统计次数
        var dic = new Dictionary<string, int>();
        var split = sb.ToString().Split(' '/*, StringSplitOptions.RemoveEmptyEntries*/);
        foreach(var word in split) {
            //过滤空值和ban列表中存在的值
            if(word.Trim() == "") continue;
            if(!banned.Contains(word)) {
                if(dic.ContainsKey(word)) {
                    dic[word]++;
                } else {
                    dic[word] = 1;
                }
            }
        }
        //输出最大值
        return dic.OrderByDescending(d => d.Value).ToList()[0].Key;
    }

}

以上给出1种算法实现,以下是这个案例的输出结果:

ball

分析:

显而易见,以上算法的时间复杂度为: O(n) 。

本文由 .Net中文网 原创发布,欢迎大家踊跃转载。

转载请注明本文地址:https://www.byteflying.com/archives/3969

发表评论

登录后才能评论