minimum-recolors-to-get-k-consecutive-black-blocks

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed string <code>blocks</code> of length <code>n</code>, where <code>blocks[i]</code> is either <code>&#39;W&#39;</code> or <code>&#39;B&#39;</code>, representing the color of the <code>ith</code> block. The characters <code>&#39;W&#39;</code> and <code>&#39;B&#39;</code> denote the colors white and black, respectively.

You are also given an integer <code>k</code>, which is the desired number of consecutive black blocks.

In one operation, you can recolor a white block such that it becomes a black block.

Return the minimum number of operations needed such that there is at least one occurrence of <code>k</code> consecutive black blocks.

&nbsp;
Example 1:

<pre>
Input: blocks = &quot;WBBWWBBWBW&quot;, k = 7
Output: 3
Explanation:
One way to achieve 7 consecutive black blocks is to recolor the 0th, 3rd, and 4th blocks
so that blocks = &quot;BBBBBBBWBW&quot;. 
It can be shown that there is no way to achieve 7 consecutive black blocks in less than 3 operations.
Therefore, we return 3.
</pre>

Example 2:

<pre>
Input: blocks = &quot;WBWBBBW&quot;, k = 2
Output: 0
Explanation:
No changes need to be made, since 2 consecutive black blocks already exist.
Therefore, we return 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == blocks.length</code></li>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>blocks[i]</code> is either <code>&#39;W&#39;</code> or <code>&#39;B&#39;</code>.</li>
	<li><code>1 &lt;= k &lt;= n</code></li>
</ul>

minimumRecolors

Minimum Recolors to Get K Consecutive Black Blocks

Max Consecutive Ones III

max-consecutive-ones-iii

最大连续1的个数 III

Maximum Points You Can Obtain from Cards

maximum-points-you-can-obtain-from-cards

可获得的最大点数

Maximum Number of Vowels in a Substring of Given Length

maximum-number-of-vowels-in-a-substring-of-given-length

定长子串中元音的最大数目

String

Sliding Window

给你一个长度为 <code>n</code>&nbsp;下标从 0&nbsp;开始的字符串&nbsp;<code>blocks</code>&nbsp;，<code>blocks[i]</code>&nbsp;要么是&nbsp;<code>'W'</code>&nbsp;要么是&nbsp;<code>'B'</code>&nbsp;，表示第&nbsp;<code>i</code>&nbsp;块的颜色。字符&nbsp;<code>'W'</code> 和&nbsp;<code>'B'</code>&nbsp;分别表示白色和黑色。

给你一个整数&nbsp;<code>k</code>&nbsp;，表示想要&nbsp;连续&nbsp;黑色块的数目。

每一次操作中，你可以选择一个白色块将它 涂成&nbsp;黑色块。

请你返回至少出现 一次&nbsp;连续 <code>k</code>&nbsp;个黑色块的 最少&nbsp;操作次数。

&nbsp;

示例 1：

<pre>
输入：blocks = "WBBWWBBWBW", k = 7
输出：3
解释：
一种得到 7 个连续黑色块的方法是把第 0 ，3 和 4 个块涂成黑色。
得到 blocks = "BBBBBBBWBW" 。
可以证明无法用少于 3 次操作得到 7 个连续的黑块。
所以我们返回 3 。
</pre>

示例 2：

<pre>
输入：blocks = "WBWBBBW", k = 2
输出：0
解释：
不需要任何操作，因为已经有 2 个连续的黑块。
所以我们返回 0 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>n == blocks.length</code></li>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>blocks[i]</code>&nbsp;要么是&nbsp;<code>'W'</code>&nbsp;，要么是&nbsp;<code>'B'</code> 。</li>
	<li><code>1 &lt;= k &lt;= n</code></li>
</ul>