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