算法日志

无重复字符最长子串

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        dd = {}
        Max = 0
        long = 0
        L_start = 0
        for i in range(len(s)):
            if s[i] in dd :
                    Max = max(Max,long)
                    L_start = max(dd[s[i]],L_start)
                    long = i - L_start 
                    dd[s[i]] =i
            else :
                dd[s[i]] = i
                long += 1
        return max(Max,long)