通过指针的思想,找出所有无重合元素的子字符串
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
ret = []
if len(s) == 0:
return 0
for i in range(len(s)):
tmp = [s[i]]
for j in range(i + 1, len(s)):
if s[j] in tmp:
break
tmp.append(s[j])
if tmp not in ret:
ret.append(tmp)
return max([len(i) for i in ret])