819. Most Common Word

最新推荐文章于 2024-11-16 14:46:58 发布

就是那个党伟

最新推荐文章于 2024-11-16 14:46:58 发布

阅读量175

点赞数

分类专栏： LeetCode 文章标签： Most Common Word 819 leetcode c++

本文链接：https://blog.csdn.net/dangwei_90/article/details/102212593

版权

LeetCode 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

class Solution {
public:
    string mostCommonWord(string paragraph, vector<string>& banned) {
        int nMost = 0;
        string strMost; 
        // 排除干扰截断项
        for(int n = 0; n < paragraph.size(); n++)
        {
            if (paragraph[n] == '!' || paragraph[n] == '?' || paragraph[n] == '\'' ||
                paragraph[n] == ',' || paragraph[n] == ';' || paragraph[n] == '.')
            {
                paragraph[n] = ' ';
                continue;
            }

            if (isalpha(paragraph[n]))
            {
                paragraph[n] = tolower(paragraph[n]);
            }

        }
        
        // 截取字符串
        unordered_map<string , int> map;
        
        bool end = true;
        int nTemp = 0;
        int nfind = 0;
        while(end)
        {
            // 从nTemp开始第一个空格
            nfind = paragraph.find(" ", nTemp);         
            string str = paragraph.substr(nTemp, nfind - nTemp);
            bool bBan = false;
            for(int m = 0; m < banned.size(); m++)
            {
                if(banned[m] == str)
                {
                    bBan = true;
                    break;
                }
            }
            if(bBan == false)
            {
                map[str] ++;
                if(map[str] > nMost)
                {
                    nMost = map[str];
                    strMost = str;
                }
            }
            
            // 判断连续多空格的情况
            for(int n = nfind; n < paragraph.size(); n++)
            {
                if(paragraph[n] == ' ')
                {
                    nfind ++;
                }
                else
                {
                    break;
                }
            }
            
            nTemp = nfind;
            
            if(nfind == -1)
            {
                end = false;
            }
        }
        
        return strMost;
    }
};