class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
left = 0
right =0
res = 0
chars = dict()
for right in range(len(s)):
if s[right] in chars:
left = max(chars[s[right]]+1, left)
chars[s[right]] = right
res = max(res, right - left + 1)
return res
字典找到位置 最左侧位置
找到左边起点
mind go fast