leetcode1297. 子串的最大出现次数

不用考虑maxsize

def maxFreq(self, s, maxLetters, minSize, maxSize):
        """
        :type s: str
        :type maxLetters: int
        :type minSize: int
        :type maxSize: int
        :rtype: int
        """
        res = collections.defaultdict(int)
        for i in range(len(s)-minSize+1):
            tmp = s[i:i+minSize]
            count = Counter(tmp)
            if len(count) <= maxLetters:
                res[tmp] += 1
        return max(res.values()) if res else 0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15