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.
分析:可以使用分治法,每次遍历字符串,找出出现次数小于k次的字符,然后用该字符分割字符串,依次求出该字符串左边和右边的长度。
class Solution(object):
def getRes(self, s, k, low, high):
if high-low+1<k or high<low:
return 0
flag=[0 for i in range(26)]
for i in range(low,high+1):
flag[ord(s[i])-ord('a')]+=1
for i in range(low,high+1):
if flag[ord(s[i])-ord('a')]>0 and flag[ord(s[i])-ord('a')]<k:
return max(self.getRes(s,k,low,i-1), self.getRes(s,k,i+1,high))
return high-low+1
def longestSubstring(self, s, k):
"""
:type s: str
:type k: int
:rtype: int
"""
if len(s)==0 or k>len(s):
return 0
flag=[0 for i in range(26)]
for i in range(0,len(s)):
flag[ord(s[i])-ord('a')]+=1
for i in range(0,len(s)):
if flag[ord(s[i])-ord('a')]>0 and flag[ord(s[i])-ord('a')]<k:
return max(self.longestSubstring(t,k) for t in s.split(s[i]))
return len(s)
#return self.getRes(s,k,0,len(s)-1)