class Solution(object):
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
r,l,n=0,0,0
while l<=len(s):
if len(s[r:l])==len(set(s[r:l])):
if n<len(s[r:l]):
n=len(s[r:l])
l+=1
else:
r+=1
l+=1
return n
leetcode 3
最新推荐文章于 2021-12-04 14:08:01 发布