题目描述
方法:
递归,计算每个字母个数,小于k的作为划分递归依据
class Solution:
def longestSubstring(self, s: str, k: int) -> int:
record = []
i = 0
if len(s) < k:
return 0
for c in s:
if s.count(c)<k:
return max(self.longestSubstring(t,k) for t in s.split(c))
return len(s)