刷题-最长不含重复字符的子串

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        # 构建两个指针index
        if (len(s) <= 1):
            return len(s)

        curMaxLen = 1
        startIndex = 0
        endIndex = 0
        curIndex = endIndex + 1
        maxLen = 1

        while (curIndex < len(s)):

            delta = s[startIndex:endIndex + 1].find(s[curIndex])
            if delta > -1:
                startIndex = startIndex + delta + 1
                endIndex = endIndex + 1
                curMaxLen = endIndex - startIndex + 1
            else:
                endIndex = endIndex + 1
                curMaxLen = curMaxLen + 1
            if curMaxLen >= maxLen:
                maxLen = curMaxLen
            curIndex = curIndex + 1
        return maxLen