leetcode._395_Longest Substring with At Least K Repeating Characters.简短2.py

def longestSubstring(self, s, k):
    for c in set(s):
        if s.count(c) < k:
            return max(self.longestSubstring(t, k) for t in s.split(c))
    return len(s)