题解 | #最长回文子串#
最长回文子串
https://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
s = input().strip()
n = len(s)
max_len = 0
for i in range(2,n+1):
for j in range(n):
ss = s[j:j+i]
if ss[::-1] == ss:
max_len = max(len(ss),max_len)
print(max_len)
顺丰集团工作强度 374人发布
