mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
28 lines
1.0 KiB
HTML
28 lines
1.0 KiB
HTML
|
<p>Given a string <code>s</code> and an integer <code>k</code>, return <em>the length of the longest substring of</em> <code>s</code> <em>such that the frequency of each character in this substring is greater than or equal to</em> <code>k</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "aaabb", k = 3
|
||
|
|
<strong>Output:</strong> 3
|
||
|
|
<strong>Explanation:</strong> The longest substring is "aaa", as 'a' is repeated 3 times.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "ababbc", k = 2
|
||
|
|
<strong>Output:</strong> 5
|
||
|
|
<strong>Explanation:</strong> The longest substring is "ababb", as 'a' is repeated 2 times and 'b' is repeated 3 times.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
|
||
|
|
<li><code>s</code> consists of only lowercase English letters.</li>
|
||
|
|
<li><code>1 <= k <= 10<sup>5</sup></code></li>
|
||
|
|
</ul>
|