题解 | #最长回文子串#
最长回文子串
https://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
s = input() ls = [] for i in range(len(s)): for j in range(i+1,len(s)): if (s[i:j+1] == s[i:j+1][::-1]): ls.append(j+1-i) print(max(ls))
最长回文子串
https://www.nowcoder.com/practice/12e081cd10ee4794a2bd70c7d68f5507
s = input() ls = [] for i in range(len(s)): for j in range(i+1,len(s)): if (s[i:j+1] == s[i:j+1][::-1]): ls.append(j+1-i) print(max(ls))
相关推荐