python leetcode 3. Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters.

最长的不重复的字符串长度

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", with the length of 3. 

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        start = -1
        max = 0
        dict = {}
        for i in range(len(s)):
            if s[i] in dict and dict[s[i]] > start:
                start = i
                dict[s[i]] = i
            else:
                dict[s[i]] = i
                if i-start > max:
                    max = i-start
        return max