题目描述
方法:滑动窗口法
遍历字符串动态添加删除子串
代码:
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
record = collections.deque()
ml = 0
for i in range(len(s)):
if s[i] not in record:
record.append(s[i])
ml = max(len(record), ml)
else:
while record[0] != s[i]:
record.popleft()
record.popleft()
record.append(s[i])
return ml