题目:
思考:
1、偶数对称子串和奇数对称子串
2、如何记录其中的最大值
class Solution(object):
def longestPalindrome(self, s):
"""
:type s: str
:rtype: str
"""
max_l = 0
res = ""
for i in range(0, len(s)):
#以s[i] 为中心向左右扩散
left, right = i, i
while(left >= 0 and right < len(s) and s[left] == s[right]):
if max_l < right - left + 1:
max_l = right - left + 1
res = s[left:right + 1]
left -= 1
right += 1
#以s[i],s[i+1]为中心向左右扩散
left, right = i, i + 1
while(left >= 0 and right < len(s) and s[left] == s[right]):
if max_l < right - left + 1:
max_l = right - left + 1
res = s[left:right + 1]
left -= 1
right += 1
return res