#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time : 2020/4/12 21:29
# @Author : 不爱码代码的码农
# @Site :
# @File : s9.py
# @Software: PyCharm
'''
给定一个字符串,找出不含有重复字符的最长子串的长度。
示例:
给定 "abcabcbb" ,没有重复字符的最长子串是 "abc" ,那么长度就是3。
给定 "bbbbb" ,最长的子串就是 "b" ,长度是1。
给定 "pwwkew" ,最长子串是 "wke" ,长度是3。请注意答案必须是一个子串,"pwke" 是 子序列 而不是子串。
''''''
'''
def lengthOfLongestSubstring(s):
"""
:type s: str
:rtype: int
"""
if len(s) == 1:
return 1
if s == '':
return 0
alllist = []
a = ''
for i in range(len(s)):
if s[i] not in a:
a = a + s[i]
if len(a) == len(s):
return len(s)
else:
alllist.append(a)
for j in range(len(a)):
if a[j] == s[i]:
a = a[j + 1:] + s[i]
break
continue
alllist.append(a)
for i in range(len(alllist)):
alllist[i] = len(alllist[i])
lengthsubstring = max(alllist)
return lengthsubstring
while True:
try:
string = input()
x = lengthOfLongestSubstring(string)
print(x)
except:
break