class Solution(object):
def lengthOflogneststring(self,s):
start=-1
max=0
d={}
for i in range(len(s)):
if s[i] in d and d[s[i]]>start:
start=d[s[i]]
d[s[i]]=i
else:
d[s[i]]=i
if i-start>max:
max=i-start
return max
最长不重复字符串python
最新推荐文章于 2023-11-26 22:00:00 发布