From ff4ce5ceab41e98b7782ad1ea5d66133108338a3 Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Thu, 17 Oct 2024 13:46:41 +0800
Subject: [PATCH] =?UTF-8?q?2024/10/17=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/Num1493.java              | 34 +++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1493.java

diff --git a/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1493.java b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1493.java
new file mode 100644
index 0000000..2f898cc
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1493.java
@@ -0,0 +1,34 @@
+package com.cool.ling_cha_mount.sliding_windows;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/17/13:46
+ * @Description: 1493. 删掉一个元素以后全为 1 的最长子数组
+ * Hard 2
+ * Level 6
+ * Score 1423
+ */
+public class Num1493 {
+    public int longestSubarray(int[] nums) {
+        int left=0;
+        int num=0;
+        int max=0;
+        for(int i=0;i<nums.length;i++){
+            if(nums[i]!=1){
+                num++;
+                if(num>1){
+                    max=Math.max(i-left,max);
+                }
+                while(num>1){
+                    if(nums[left++]!=1){
+                        num--;
+                    }
+                }
+            }
+        }
+        max=Math.max(max,nums.length-left);
+        return max-1;
+    }
+}