LeetCode赛题395----Longest Substring with At Least K Repeating Characters - HorseShoe2016 - 博客园

LeetCode赛题395----Longest Substring with At Least K Repeating Characters - HorseShoe2016 - 博客园

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.

Read full article from LeetCode赛题395----Longest Substring with At Least K Repeating Characters - HorseShoe2016 - 博客园