题目描述 请从字符串中找出一个最长的不包含重复字符的子字符串,计算该最长子字符串的长度。 思路 详见链接 代码 class Solution: def lengthOfLongestSubstring(self,s): result = 0 low = 0 for high in range(len(s)): if s[high] not in s[low:high]: result = max(high-low+1,result) else: while s[high] in s[low:high]: low += 1 return result