def longestPalindrome(s: str): # 优先选择长度长的子串作判断 for j in range(len(s), -1, -1): for i in range(len(s) - j, -1, -1): if (s[i:i + j]) == s[i:i + j][::-1]: return s[i:i + j][::-1]
def longestPalindrome(s: str): # 优先选择长度长的子串作判断 for j in range(len(s), -1, -1): for i in range(len(s) - j, -1, -1): if (s[i:i + j]) == s[i:i + j][::-1]: return s[i:i + j][::-1]