1297. 子串的最大出现次数

题目链接：

https://leetcode-cn.com/problems/maximum-number-of-occurrences-of-a-substring/comments/

class Solution {
public:
    int maxFreq(string s, int maxLetters, int minSize, int maxSize) {
        string str_temp;
        int s_len=s.size();
        map<string,int>mapp;
        int Max=0;
        //长的串重复它的子串也必然重复，且子串数量大于等于长的串的数量，所以maxSize是没有任何作用的
        int len=minSize;
            for(int i=0;i<=s_len-len;i++)
            {
                str_temp=s.substr(i,len);
                bool ch_flag[30]={false};
                int Count_char=0;
                for(int j=0;j<len;j++)
                {
                    if(!ch_flag[str_temp[j]-'a'])
                    {
                        Count_char++;
                        ch_flag[str_temp[j]-'a']=true;
                    }
                }
                if(Count_char<=maxLetters)
                {
                    mapp[str_temp]++;
                }
            }
            for(auto it=mapp.begin();it!=mapp.end();it++)
            {
                Max=max(Max,it->second);  
            }
            return Max;
        }
};