LeetCode3 Longest Substring Without Repeating Characters

【文件属性】：
文件名称：LeetCode3 Longest Substring Without Repeating Characters
文件大小：11KB
文件格式：ZIP
更新时间：2021-01-29 13:52:40
LeetCode3 Java Longest Substring Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b", with the length of 1. Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring. Java AC版本

【文件预览】：
3
----3.iml(423B)
----src()
--------MainSolution.java(3KB)
----.idea()
--------kotlinc.xml(232B)
--------misc.xml(273B)
--------workspace.xml(39KB)
--------modules.xml(242B)
----out()
--------production()