力扣-5 最长回文子串

# 双重循环，会超时
class Solution:
    def longestPalindrome(self, s: str) -> str:
        n = len(s)
        dp = [[False] * n for _ in range(n)]	# 注意定义二维列表的方法
        ans = ""
        # 枚举子串的长度，从0开始
        for l in range(n):
            # 枚举子串的起始位置 i，这样可以通过 j=i+l 得到子串的结束位置
            for i in range(n):
                j = i + l
                if j >= len(s):
                    break
                if l == 0:
                    dp[i][j] = True
                elif l == 1:
                    dp[i][j] = (s[i] == s[j])
                else:
                    dp[i][j] = (dp[i + 1][j - 1] and s[i] == s[j])
                if dp[i][j] and l + 1 > len(ans):
                    ans = s[i:j+1]
        return ans

class Solution:
    def extend(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.extend(s,i,i)
            left2, right2 = self.extend(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]