From 955e0e3d058b1a76e8f719105796e83fa9efb3a7 Mon Sep 17 00:00:00 2001
From: wangsiyuan <2392948297@qq.com>
Date: Tue, 5 Sep 2023 15:57:36 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=20test.java?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/solution/test.java | 30 +-----------------------------
 1 file changed, 1 insertion(+), 29 deletions(-)

diff --git a/src/solution/test.java b/src/solution/test.java
index d448973..9e71145 100644
--- a/src/solution/test.java
+++ b/src/solution/test.java
@@ -6,34 +6,6 @@ import java.util.Set;
 
 public class test {
     public static void main(String[] args) {
-        String s = "bbbbb";
-        String s1 = "abcabcbb";
-        String s2 = "pwwkew";
-        String s3 = "ckilbkd";
-        String s4 = "dvdf";
-        System.out.println(lengthOfLongestSubstring(s3));
-
+        
     }
-    public static int lengthOfLongestSubstring(String s) {
-        // 哈希集合，记录每个字符是否出现过
-        Set<Character> occ = new HashSet<Character>();
-        int n = s.length();
-        // 右指针，初始值为 -1，相当于我们在字符串的左边界的左侧，还没有开始移动
-        int rk = -1, ans = 0;
-        for (int i = 0; i < n; ++i) {
-            if (i != 0) {
-                // 左指针向右移动一格，移除一个字符
-                occ.remove(s.charAt(i - 1));
-            }
-            while (rk + 1 < n && !occ.contains(s.charAt(rk + 1))) {
-                // 不断地移动右指针
-                occ.add(s.charAt(rk + 1));
-                ++rk;
-            }
-            // 第 i 到 rk 个字符是一个极长的无重复字符子串
-            ans = Math.max(ans, rk - i + 1);
-        }
-        return ans;
-    }
-
 }