题解 | 最长回文子串
最长回文子串
https://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
s = input()
y = set()
for i in range(len(s)):
for j in range(len(s[i:])):
if s[i:i+j+1] == s[i:i+j+1][::-1]:
y.add(len(s[i:i+j+1]))
print(max(y))
查看18道真题和解析