3. 无重复字符的最长子串
来源: 3. 无重复字符的最长子串
1. 解题思路
滑动窗口寻找最大字符串
2. 代码
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
length = l = r = 0
while r<len(s):
if s[r] not in s[l:r]:
r += 1
length = max(length, r-l)
else:
l += 1
return length