class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
right,ans,n,seen=-1,0,len(s),set()
for i in range(n):
if i:
seen.remove(s[i-1])
while right+1<n and s[right+1] not in seen:
seen.add(s[right+1])
right+=1
ans = max(ans, right-i+1)
return ans
leetcode-3
最新推荐文章于 2024-01-26 01:55:06 发布