无重复字符最长子串
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
c=[]
count=0
n=len(s)
for i in range(n):
if s[i] not in c:
c.append(s[i])
count=len(c) if len(c)>count else count
else:
index=c.index(s[i])
c=c[index+1:]
c.append(s[i])
return count