题解 | 最长回文子串
最长回文子串
https://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
s = input()
max_len = 0
for i in range(len(s)):
for j in range(i, len(s)):
sub = s[i:j+1]
if sub == sub[::-1]:
max_len = max(max_len, j - i + 1)
print(max_len)