python基础编程_30_周期串的最小最大子串

#输出最小的循环子串
mystr=input()
count=0
for i in range(1,len(mystr)):
    if len(mystr)%i==0:
        flag=True        
        for j in range(i,len(mystr)):
            if mystr[j%i]!=mystr[j]:
                flag=False
                break
        if flag:
            count=i
            print(count)
            break

if count==0:
    print('this is not circle str')

hellohelloh
this is not circle str
>>> ================================ RESTART ================================
>>> 
hehehe
2
>>> ================================ RESTART ================================
>>> 
aaaaaaaaaaaa
1

最大子串长度:

#输出最大的循环子串
mystr=input()
count=0
for i in range(1,len(mystr)):
    if len(mystr)%i==0:
        flag=True        
        for j in range(i,len(mystr)):
            if mystr[j%i]!=mystr[j]:
                flag=False
                break
        if flag:
            if i>count:
                count=i
                
            

if count==0:
    print('this is not circle str')
else:
    print(count)

hehehehe
4
>>> ================================ RESTART ================================
>>> 
aaaaaaaaaaaaaa
7