写法二：

s, t = input().split()
if len(s) < len(t):s, t = t, s
for i in range(len(s)):str = s[i:] + s[:i]if str.find(t) != -1:print('true')break
else:print('false')

写法三：

s, t = input().split()
if len(s) < len(t):s, t = t, s
s *= 2
if s.find(t) == -1:print('false')
else:print('true')

七、字符串乘方

这个就是寻找最小的重复子串，且这个子串可以重复多次构成母串

写法一：

def check(l, s):p = s[:l]for i in range(l, len(s), l):cur = s[i: i + l]if p != cur:return Falsereturn True
while 1:s = input()if s == '.':breakl = len(s)maxl = 1for curl in range(1, l):if check(curl, s):maxl = max(maxl, int(l / curl))print(maxl)

写法二：

字符串最小的，肯定是重复次数最多的，所以我们只要一找到符合要求的，就可以跳出循环

while True:s = input()if s == '.':breakn = len(s)for i in range(1, n + 1):if n % i == 0:cs = s[:i]res = int(n / i)cs *= res#将求出的字符串和原来的字符串对比，如果是那就说明这个方案可行if cs == s:print(res)break

写法三：

from collections import Counter

记录每个数字出现了多少次

from collections import Counter
while True:s = input()if s == '.':breakc = Counter(s)print(min(c.values()))

八、字符串最大跨度

写法一：

s, a, b = map(str, input().split(','))
if s.find(a) != -1 and s.find(b) != -1:ai = s.find(a) + len(a)s = s[::-1]b = b[::-1]bi = len(s) - s.find(b) - len(b)if ai <= bi:print(bi - ai)else:print(-1)
else:print(-1)

写法二：

rfind

向前查询

s,s1,s2 = input().split(",")
a = s.find(s1)
b = s.rfind(s2)
if(a == -1 or b == -1 or a+len(s1) >= b):print("-1")
else:print(b-a-len(s1))

九、最长公共字符串后缀

while True:n = int(input())if n == 0:breakls = []for i in range(n):ls.append(input().strip()[::-1])s1 = min(ls)#获取ls中最小的元素s2 = max(ls)res = ''for i in range(len(s1)):if s1[i] == s2[i]:res += s1[i]else:breakprint(res[::-1])