题目描述
blablabla
样例
class Solution:
def longestSubstringWithoutDuplication(self, s):
"""
:type s: str
:rtype: int
"""
if not s:
return 0
if len(s) == 1:
return 1
l = len(s)
memo = set(s[0])
left = 0
right = 1
longest = 0
for left in range(l):
while right < l and s[right] not in memo:
memo.add(s[right])
right += 1
longest = max(longest, right - left)
memo.remove(s[left])
return longest