A = "fccf edfgfde"
max_sub = []
for i in range(len(A)-1):
tmp = []
if A[i]==A[i+1]:
tmp.append(A[i])
tmp.append(A[i+1])
j = 1
while i-j>=0 and i+1+j<len(A)-1:
lc = A[i-j]
rc = A[i+1+j]
if lc==rc:
tmp.insert(0, lc)
tmp.append(rc)
j += 1
if len(tmp)>len(max_sub): max_sub = tmp
if i>1 and A[i-1]==A[i+1]:
tmp.append(A[i])
j = 1
while i-j>0 and i+j<len(A)-1:
lc = A[i-j]
rc = A[i+j]
if lc==rc:
tmp.insert(0, lc)
tmp.append(rc)
j += 1
if len(tmp)>len(max_sub): max_sub = tmp
print(max_sub)
寻找最大回文字符串(python)
最新推荐文章于 2024-06-17 09:39:55 发布