力扣：3.无重复字符的最长子串

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        current_len, max_len,i= 0,0,0
        leng = len(s)
        for k in range(leng):
            if(s[k] not in s[i:k]):
                current_len += 1  
                max_len = max_len if max_len > current_len else current_len
            else:
                diff = s[i:k].index(s[k])    # 找到重复字符在前面字符串中的索引值
                i = diff + 1+i
                current_len -= diff
                if (leng - i) < max_len:
                    break
                
        return max_len