力扣题解：无重复字符的最长子串

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        if not s:return 0
        n=len(s)
        new=[]
        nums=[]
        max_num=0
        for j in range(n):
            for i in range(j,n):
                if s[i] not in new:
                    new.append(s[i])
                    continue
                elif s[i] in new:
                    break
            nums.append(len(new))
            new=[]
        for num in nums:
            if num >= max_num:
                max_num=num
        return max_num
#从字符串的第j个字符开始搜索下一个相同字符，求出无重复子串的所有长度，输出最大值
#新手小白的个人拙见，有错误请大佬指出