class Solution:
def longestSubstringWithoutDuplication(self, s):
res={}
ans=0
i,j=0,0
while i[HTML_REMOVED]1:
res[s[j]]-=1
j+=1//j往前走
ans=max(ans,i-j+1)
i+=1
return ans