剑指 Offer 48：最长不含重复字符的子字符串

题目描述：

请从字符串中找出一个最长的不包含重复字符的子字符串，计算该最长子字符串的长度。

def zcbcfzc(s):

    d = {}
    head = tail = 0
    res = 0

    while head <= len(s)-1:
        if s[head] in d:
            tail = max(tail, d[s[head]] + 1)
        # 更新状态
        d[s[head]] = head  # 记录当前字符下标
        res = max(res, head - tail + 1)
        head += 1
    return res

print(zcbcfzc('yuirfhuytrrfgcvu'))
# 7