LeetCode 热题 HOT 100之最长回文子串

class Solution:
    def longestPalindrome(self, s: str) -> str:
        left, right = 0, 0

        def expand(s, l, r):
            while l >= 0 and r < len(s) and s[l] == s[r]:
                l -= 1
                r += 1
            return l + 1, r - 1

        for i in range(len(s)):
            left1, right1 = expand(s, i, i)
            if right - left < right1 - left1:
                left, right = left1, right1
            left2, right2 = expand(s, i, i + 1)
            if right - left < right2 - left2:
                left, right = left2, right2
        return s[left:right + 1]