def lengthOfLongestSubstring(self, s):
ans = start = 0
pos = {} # last index of element
for end, c in enumerate(s):
if c in pos:
start = max(start, pos[c]+1)
pos[c] = end
ans = max(ans, end-start+1)
return ans
最长不含重复字符串的子串
最新推荐文章于 2024-03-23 11:24:14 发布