LeetCode热题100——5. 最长回文子串

方法

其他解法

1.多维动态规划
用二维数组记录i到j是否构成回文。

class Solution(object):
    def longestPalindrome(self, s):
        """
        :type s: str
        :rtype: str
        """
        n = len(s)
        max_L = 1
        start = 0
        if n < 2:
            return s
        record = [[False] * n for _ in range(n)]
        for i in range(n):
            record[i][i] = True
        for L in range(2, n+1):
            for i in range(n):
                j = L + i - 1
                if j >= n:
                    break
                if s[i] != s[j]:
                    record[i][j] = False
                else:
                    if L <= 3:
                        record[i][j] = True
                    else:
                        record[i][j] = record[i+1][j-1]
                if record[i][j] and L > max_L:
                    max_L = L
                    start = i
        return s[start: start+max_L]

2.中心扩展法
遍历每一个字母，以它为中心或者以它和它右侧的字母为中心，寻找最长回文串。

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

    def longestPalindrome(self, s: str) -> str:
        start, end = 0, 0
        for i in range(len(s)):
            left1, right1 = self.expandAroundCenter(s, i, i)
            left2, right2 = self.expandAroundCenter(s, i, i + 1)
            if right1 - left1 > end - start:
                start, end = left1, right1
            if right2 - left2 > end - start:
                start, end = left2, right2
        return s[start: end + 1]

作者：力扣官方题解
链接：https://leetcode.cn/problems/longest-palindromic-substring/solutions/255195/zui-chang-hui-wen-zi-chuan-by-leetcode-solution/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。