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

diff --git a/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num3090.java b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num3090.java
new file mode 100644
index 0000000..7483689
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num3090.java
@@ -0,0 +1,31 @@
+package com.cool.ling_cha_mount.sliding_windows;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/16/17:05
+ * @Description: 3090. 每个字符最多出现两次的最长子字符串
+ * Level 2
+ * Hard 1
+ * Score 1329
+ */
+public class Num3090 {
+
+    public int maximumLengthSubstring(String s) {
+        int res=0;
+        int[] arr=new int[26];
+        int left=0;
+        for(int i=0;i<s.length();i++){
+            if(++arr[s.charAt(i)-'a']>2){
+                while(left<i){
+                    if(--arr[s.charAt(left++)-'a']==2){
+                        break;
+                    }
+                }
+            }
+            res=Math.max(res,i-left+1);
+        }
+        return res;
+    }
+}