题解 | #最长回文子串#
最长回文子串
https://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
while True:
try:
s=input()
result=[]
for i in range(len(s)):
for j in range(len(s),i,-1):
if s[i:j]==s[i:j][::-1]:
result.append(len(s[i:j]))
print(max(result))
except:
break
字节跳动二面565人在聊
