【leedcode】0003. 无重复字符最长子串

def maxSizeSubstring(s):
    res,cur,dic = 0,0,{}
    for idx in range(len(s)):
        if s[idx] in dic:
            cur = max(cur, dic[s[idx]] + 1)
        dic[s[idx]] = idx
        res = max(res, idx - cur + 1)      
    return res
sample = "abcabcbb","bbbbb","pwwkew","I am HannYang."
for s in sample:
    print(maxSizeSubstring(s))

def maxSizeSubstring2(s):
    res = 0
    for i in range(len(s)):
        for j in range(len(s),0,-1):
            if i>=j: continue
            t = s[i:j]
            size = len(t)
            if size==len(set(t)):
                if size>res:
                    res = size
    return res
sample = "abcabcbb","bbbbb","pwwkew","I am HannYang."
for s in sample:
    print(maxSizeSubstring2(s))