mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
31 lines
1.2 KiB
HTML
31 lines
1.2 KiB
HTML
<p>You are given a string <code>s</code> and an integer <code>k</code>. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most <code>k</code> times.</p>
|
|
|
|
<p>Return <em>the length of the longest substring containing the same letter you can get after performing the above operations</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "ABAB", k = 2
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> Replace the two 'A's with two 'B's or vice versa.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "AABABBA", k = 1
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> Replace the one 'A' in the middle with 'B' and form "AABBBBA".
|
|
The substring "BBBB" has the longest repeating letters, which is 4.
|
|
There may exists other ways to achieve this answer too.</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
|
<li><code>s</code> consists of only uppercase English letters.</li>
|
|
<li><code>0 <= k <= s.length</code></li>
|
|
</ul>
|