deflengthOfLongestSubstring(s):"""
:type s: str
:rtype: int
"""
st ={}
i, ans =0,0for j inrange(len(s)):if s[j]in st:
i =max(st[s[j]], i)#如果重复,记录新坐标索引, 若重复的是很前边的,i保持不变
ans =max(ans, j - i +1)
st[s[j]]= j +1#记录遍历过的字母索引+1return ans
if __name__ =="__main__":
s ='bdddvbfgf'print(lengthOfLongestSubstring(s))