给定一个有小写字母组成的字符串S,将其分割成尽量多的子串,并保证每个字母最多只在其中一个子串中出现。请返回由一个或多个整数表示的分割后各个子串的长度。如:‘ababbacadefgdehijhklij’= ‘ababbaca‘ + ’defgde‘+ ’hijhklij‘。
#str1 = 'ababbacadefgdehijhklij'
str1 = input()
def str_count(str_n):
count = 0
while(str_n != ''):
count = count + 1
max_num = 0
len1 = len(str_n)
start = str_n[0]
'''
for i in range(len1):
if start == str_n[i]:
max_num = i
str2 = str_n[:max_num+1]
'''
#获得 同一个字符之间的 字符串 如:ababbaca
str2 = str_n[:str_n.rindex(start)+1]
#在剩余的字符串中 依次判断是否 有在str2中的字符,如有把此之前的元素都放到str2中
for i in range(max_num+1,len1):
if str_n[i] in str2:
max_num = i
str2 = str_n[:max_num+1]
str3 = str_n[max_num+1:]
#print(str2,':',len(str2))
print(len(str2),end=' ')
str_n = str3
str_count(str1)