给定一个字符串 s,找到 s 中最长的回文子串。你可以假设 s 的最大长度为1000。
示例 1:
输入: “babad”
输出: “bab”
注意: "aba"也是一个有效答案。
示例 2:
输入: “cbbd”
输出: “bb”
class Solution:
def longestPalindrome(self, s):
start, end = 0, 0
len1_max = 0
len2_max = 0
len_max = 0
for x in range(len(s)):
len1 = self.zuoyou(s, x, x)
if len1_max < len1:
len1_max = len1
len2 = self.zuoyou(s, x, x+1)
if len2_max < len2:
len2_max = len2
newlen_max = max(len1_max, len2_max)
if newlen_max > len_max:
start = x - (newlen_max - 1) // 2
end = x + newlen_max // 2
len_max = newlen_max
return s[start:end+1]
def zuoyou(self, s, left, right):
while left >= 0 and right < len(s) and s[left] == s[right]:
left -= 1
right += 1
return right - left - 1