【蓝桥杯每日一练---最长不重复子串】

Given a string, find the length of the longest substring without repeating characters.

https://leetcode.com/problems/longest-substring-without-repeating-characters/

x=input()
a=set(x)
print(a)
i=0
for j in a:
    i=i+1
print(i)

修改后

l, r = 0, 0
ret = 0
char_dict = {}
char_dict[S[0]] = 1
for r in range(1, n):
    char_dict[S[r]] += 1
    # 当S[r]位置的字符大于1，说明区间非法，开始移动区间左侧
    # 最多l=r时结束，不用担心越界
    while char_dict[S[r]] > 1:
        char_dict[S[l]] -= 1
        l += 1
    ret = max(ret, r - l + 1)
return ret