题解 | #最长回文子串#

class Solution:
    def getLongestPalindrome(self , A: str) -> int:
        # write code here
        if not A:
            return 0
        max_length = 0
        for i in range(len(A)):
            start = max(0, i-max_length-1)
            tmp = A[start: i+1]
            if tmp == tmp[::-1]:
                max_length = len(tmp)
            else:
                tmp = tmp[1:]
                if tmp == tmp[::-1]:
                    max_length = len(tmp)
        return max_length