给定一个字符串 s,找到 s 中最长的回文子串。你可以假设 s 的最大长度为1000。
示例 1:
输入: "babad" 输出: "bab" 注意: "aba"也是一个有效答案。
示例 2:
输入: "cbbd" 输出: "bb"
示例代码
#!/usr/bin/python3
import math
def longestPalindrome(str):
start = 0
end = 0
for i in range(0,len(str)):
len1 = expandAroundCenter(str,i,i)
len2 = expandAroundCenter(str,i,i+1)
maxlen = max(len1,len2)
if maxlen > end - start:
start = i - int((maxlen - 1)/2)
end = i + int(maxlen/2)
result = str[start:end+1]
return result
def expandAroundCenter(str,left,right):
while left>=0 and right < len(str) and str[left]==str[right]:
left = left - 1
right = right + 1
return right - left - 1
str=input()
print(longestPalindrome(str))