python leetcode 5. Longest Palindromic Substring

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

最长的回文字符串

Example 1:

Input: "babad"
Output: "bab"
Note: "aba" is also a valid answer.

Example 2:

Input: "cbbd"
Output: "bb"

class Solution(object):
    def longestPalindrome(self, s):
        """
        :type s: str
        :rtype: str
        """
        Palindrome = ''
        # BAB类型
        for i in range(len(s)):
            Palindrome1 = self.getPalindrome(s, i, i)
            if len(Palindrome1) > len(Palindrome):
                Palindrome = Palindrome1
        # BAAB类型
        for i in range(len(s)):
            Palindrome2 = self.getPalindrome(s, i, i + 1)
            if len(Palindrome2) > len(Palindrome):
                Palindrome = Palindrome2
        return Palindrome

    def getPalindrome(self, s, left, right):
        while left >= 0 and right < len(s) and s[left] == s[right]:
            left -= 1
            right += 1
        return s[left + 1:right]