代码复用---滑动窗口算法

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        #左右指针圈定范围
        left = 0               
        right = 0
        #计数，记录下来没次的指针长度
        count = 0
        #记录最大的数
        maxcount = 0
        ##如果right的值不在当前序列中则右指针移动，否则左指针移动
        ##移动过程中改变count 并且记录最大值
        while left <= right and right < len(s):
            if s[right] not in s[left:right]:
                right = right + 1
                count = count + 1
                if count > maxcount:
                    maxcount = count
            else:
                left = left + 1
                count = count - 1
        return maxcount