题解 | #最长回文子串#
最长回文子串
http://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
s = input()
r = 1
for i in range(len(s)-1):
for j in range(i+1, len(s)+1):
p = s[i:j]
l = len(p)
if p == p[::-1] and l > r:
r = l
print(r)
