From ec621a7da2147b1e19b909d9728c4524ecda5943 Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Fri, 25 Oct 2024 17:40:45 +0800
Subject: [PATCH] =?UTF-8?q?2024/10/25=20=E7=81=B5=E8=8C=B6=E9=A2=98?=
 =?UTF-8?q?=E5=8D=95=20=E4=B8=8D=E5=AE=9A=E9=95=BF=E6=BB=91=E5=8A=A8?=
 =?UTF-8?q?=E7=AA=97=E5=8F=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1004.java b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1004.java
new file mode 100644
index 0000000..4f9a12e
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1004.java
@@ -0,0 +1,25 @@
+package com.cool.ling_cha_mount.sliding_windows;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/25/17:40
+ * @Description: 1004. 最大连续1的个数 III
+ * @Score 1656
+ */
+public class Num1004 {
+    public int longestOnes(int[] nums, int k) {
+        int zNum=0;
+        int res=0;
+        int left=0;
+        for(int i=0;i<nums.length;i++){
+            zNum+=(nums[i]^1);
+            while(zNum>k){
+                zNum-=(nums[left++]^1);
+            }
+            res=Math.max(res,i-left+1);
+        }
+        return res;
+    }
+}