[leetcode] 395. Longest Substring with At Least K Repeating Characters @ python

原题

Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than k times.

Example 1:

Input:
s = “aaabb”, k = 3

Output:
3

The longest substring is “aaa”, as ‘a’ is repeated 3 times.
Example 2:

Input:
s = “ababbc”, k = 2

Output:
5

The longest substring is “ababb”, as ‘a’ is repeated 2 times and ‘b’ is repeated 3 times.

解法

分治法+递归. base case是当s的长度小于k时, 返回0, 然后我们查找s中出现次数小于k的字符, 递归求不包含该字符的所有子字符串中最大的长度. 如果s中所有字符出现次数都大于等于k, 那么返回s的长度.

代码

class Solution(object):
    def longestSubstring(self, s, k):
        """
        :type s: str
        :type k: int
        :rtype: int
        """
        # base case
        if len(s) < k:
            return 0
        
        for c in set(s):
            if s.count(c) < k:
                return max(self.longestSubstring(sub, k) for sub in s.split(c))
        
        return len(s)