返回最长子串长度 和最长子串
class Solution:
def length(self,s):
start,res,cache,dic=0,0,{},{}
for idx,c in enumerate(s):
if c in cache and cache[c]>=start:
start=cache[c]+1
cache[c]=idx
else:
cache[c]=idx
cur=idx-start+1
dic[cur]=s[start:idx+1]
res=max(cur,res)
n=sorted(dic,reverse=True)
print(res)
print(dic[n[0]])
l=Solution()
s="aasddsdas"
l.length(s)