给定一个字符串，找到最长子字符串的长度而不重复字符。

def lengthOfLongestSubstring(s):
    i = j = l = 0
    for j, c in enumerate(s):
        if c in s[i:j]:
            print(s[i:j])
            l = max(l, len(s[i:j]))
            i += s[i:j].index(c) + 1
    return max(l, len(s[i:j+1]))
lengthOfLongestSubstring('abcabcabc')