2024/10/06 灵神题单 滑动窗口
This commit is contained in:
parent
d79302a585
commit
72ad8db33c
|
@ -0,0 +1,39 @@
|
|||
package com.cool.ling_cha_mount.sliding_windows;
|
||||
|
||||
/**
|
||||
* Created with IntelliJ IDEA.
|
||||
*
|
||||
* @Author: Cool
|
||||
* @Date: 2024/10/06/9:23
|
||||
* @Description: 2379. 得到 K 个黑块的最少涂色次数
|
||||
* DayNumber 1
|
||||
* Hard 1
|
||||
* Level 3
|
||||
*/
|
||||
public class Num2379 {
|
||||
|
||||
public int minimumRecolors(String blocks, int k) {
|
||||
int blackNum=0;
|
||||
int maxBlack=0;
|
||||
for(int i=0;i<k;i++){
|
||||
if(blocks.charAt(i)=='B'){
|
||||
blackNum++;
|
||||
}
|
||||
}
|
||||
if(blackNum==k){
|
||||
return 0;
|
||||
}
|
||||
maxBlack=blackNum;
|
||||
for(int i=k;i<blocks.length();i++){
|
||||
if(blocks.charAt(i-k)=='B'){
|
||||
blackNum--;
|
||||
}
|
||||
if(blocks.charAt(i)=='B'){
|
||||
blackNum++;
|
||||
}
|
||||
maxBlack=Math.max(maxBlack,blackNum);
|
||||
}
|
||||
return k-maxBlack;
|
||||
}
|
||||
|
||||
}
|
Loading…
Reference in New Issue