Table of Content
题目：
提供一个比较容易想到的解法，主要思路是利用滑动窗口，参考代码如下：
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
class Solution: def longestPalindrome(self, s): """ :type s: str :rtype: str """ s = s mlen = len(s) while True: i = 0 while i + mlen <= len(s): sl = s[i:i + mlen] sr = sl[::-1] if sl == sr: return sl i = i + 1 mlen = mlen - 1 if mlen == 0: return "No solution" |
