class Solution(object):
def longestSubstring(self, s, k):
"""
:type s: str
:type k: int
:rtype: int
"""
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)
395. Longest Substring with At Least K Repeating Characters
最后编辑于 :
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- Find the length of the longest substring T of a given str...
- Find the length of the longest substringTof a given strin...
- My code: reference:https://discuss.leetcode.com/topic/573...
- 题目 Find the length of the longest substring T of a given ...
- My code: 和 Longest Substring with At Most Two Distinct C...