leetcodeday16

无重复字符的最长子串
1，找出第一个无重复字符串并用i，j标记头和尾
2，向后滑动i直致无重复
3，找出最长即可

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        i = 0
        j = 0
        c = 0
        n = len(s)
        while j < n:
            if s[j] in s[i:j]:
                c = max([j - i, c])
                i += 1
                while s[j] in s[i:j]:
                    i += 1
            j += 1
        if c < j - i:
            return j - i
        return c