题解 | 最长回文子串

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
#
# @param A string字符串
# @return int整型
#
class Solution:
    def getLongestPalindrome(self, A: str) -> int:
        # write code here
        max_value1 = 1

        for i in range(len(A)):
            temp = 1
            for j in range(min(i, len(A) - i - 1)):
                if A[i - j - 1] == A[i + j + 1]:
                    temp += 2
                else:
                    break
            max_value1 = max(temp, max_value1)

        max_value2 = 1
        for i in range(1, len(A)):
            if A[i - 1] == A[i]:
                temp = 2
                for j in range(min(i - 1, len(A) - i - 1)):
                    if A[i - j - 1 - 1] == A[i + j + 1]:
                        temp += 2
                    else:
                        break
                max_value2 = max(temp, max_value2)
        return max(max_value1, max_value2)