class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
cur_str = set()
cur, longest = 0, 0
l, r, n = 0, 0, len(s)
while r < n:
if s[r] not in cur_str:
cur_str.add(s[r])
cur += 1
r += 1
else:
longest = max(longest, cur)
while s[r] in cur_str:
cur_str.remove(s[l])
cur -= 1
l += 1
return max(longest, cur)
刷题记录:3. 无重复字符的最长子串
最新推荐文章于 2022-10-16 14:59:23 发布