mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-26 07:18:56 +08:00
50 lines
2.5 KiB
HTML
50 lines
2.5 KiB
HTML
<p>A teacher is writing a test with <code>n</code> true/false questions, with <code>'T'</code> denoting true and <code>'F'</code> denoting false. He wants to confuse the students by <strong>maximizing</strong> the number of <strong>consecutive</strong> questions with the <strong>same</strong> answer (multiple trues or multiple falses in a row).</p>
|
|
|
|
<p>You are given a string <code>answerKey</code>, where <code>answerKey[i]</code> is the original answer to the <code>i<sup>th</sup></code> question. In addition, you are given an integer <code>k</code>, the maximum number of times you may perform the following operation:</p>
|
|
|
|
<ul>
|
|
<li>Change the answer key for any question to <code>'T'</code> or <code>'F'</code> (i.e., set <code>answerKey[i]</code> to <code>'T'</code> or <code>'F'</code>).</li>
|
|
</ul>
|
|
|
|
<p>Return <em>the <strong>maximum</strong> number of consecutive</em> <code>'T'</code>s or <code>'F'</code>s <em>in the answer key after performing the operation at most</em> <code>k</code> <em>times</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> answerKey = "TTFF", k = 2
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong> We can replace both the 'F's with 'T's to make answerKey = "<u>TTTT</u>".
|
|
There are four consecutive 'T's.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> answerKey = "TFFT", k = 1
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> We can replace the first 'T' with an 'F' to make answerKey = "<u>FFF</u>T".
|
|
Alternatively, we can replace the second 'T' with an 'F' to make answerKey = "T<u>FFF</u>".
|
|
In both cases, there are three consecutive 'F's.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> answerKey = "TTFTTFTT", k = 1
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong> We can replace the first 'F' to make answerKey = "<u>TTTTT</u>FTT"
|
|
Alternatively, we can replace the second 'F' to make answerKey = "TTF<u>TTTTT</u>".
|
|
In both cases, there are five consecutive 'T's.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == answerKey.length</code></li>
|
|
<li><code>1 <= n <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>answerKey[i]</code> is either <code>'T'</code> or <code>'F'</code></li>
|
|
<li><code>1 <= k <= n</code></li>
|
|
</ul>
|