5.最长回文子串
给定一个字符串 s
,找到 s
中最长的回文子串。你可以假设 s
的最大长度为 1000。
示例 1:
输入: "babad" 输出: "bab" 注意: "aba" 也是一个有效答案。
示例 2:
输入: "cbbd" 输出: "bb"
错误:
可能由于decode原因,无法读取输入?AttributeError: 'str' object has no attribute 'decode'
代码:
class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: str """ searchlength = len(s) while searchlength>=1 : for d in range(0, len(s) - searchlength + 1): string = s[d:searchlength + d] length = len(string) differ = 0 if length % 2 == 0: imax = int(length / 2) - 1 else: imax = int((length - 1) / 2 - 1) for i in range(0, imax + 1): if string[i] != string[length - i - 1]: differ = differ + 1 else: differ = differ if differ > 0: searchlength = searchlength - 1 else: return (string) break if (differ == 0) : break