Advertisement
2379. Minimum Recolors to Get K Consecutive Black Blocks
EasyView on LeetCode
2379.cs
C#
public class Solution
{
public int MinimumRecolors(string blocks, int k)
{
int countB = 0;
int maxCountB = 0;
for (int i = 0; i < blocks.Length; ++i)
{
if (blocks[i] == 'B')
++countB;
if (i >= k && blocks[i - k] == 'B')
--countB;
maxCountB = Math.Max(maxCountB, countB);
}
return k - maxCountB;
}
}Advertisement