题解 | #最长回文子串#

while True:
try:
raw_str = input()
m = len(raw_str)
max_len = 0
for i in range(m):
for j in range(i, m):
pa_num = raw_str[i:j+1]
reverse_num = pa_num[::-1]
if pa_num == reverse_num:
if max_len < len(reverse_num):
max_len = len(reverse_num)
print(max_len)
except:
break