From 72ad8db33c8b6ba14615e980767c640c443ddbaa Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Sun, 6 Oct 2024 09:24:02 +0800
Subject: [PATCH] =?UTF-8?q?2024/10/06=20=E7=81=B5=E7=A5=9E=E9=A2=98?=
 =?UTF-8?q?=E5=8D=95=20=E6=BB=91=E5=8A=A8=E7=AA=97=E5=8F=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../sliding_windows/Num2379.java              | 39 +++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 src/main/java/com/cool/ling_cha_mount/sliding_windows/Num2379.java

diff --git a/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num2379.java b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num2379.java
new file mode 100644
index 0000000..2130bf1
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num2379.java
@@ -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;
+    }
+
+}