5 最长回文子串class Solution: def longestPalindrome(self, s: str) - str: nlen(s) left_ansright_ans0 for i in range(n): lri while l0 and rn and s[l]s[r]: l-1 r1 if r-l-1right_ans-left_ans: left_ansl1 right_ansr for i in range(n): li ri1 while l0 and rn and s[l]s[r]: l-1 r1 if r-l-1right_ans-left_ans: left_ansl1 right_ansr return s[left_ans:right_ans]