最长回文子串
class Solution:
def longestPalindrome(self, s: str) -> str:
k=len(s)
longeststr=''
longestlen=0
c = [[0 for i in range(k)] for i in range(k)]
for j in range(0,k):
for i in range(0,j+1):
if j-i<=1:
if s[i]==s[j]:
c[i][j]=1
if longestlen<j-i+1:
longeststr = s[i:j+1]
longestlen = j-i + 1
else:
if s[i]==s[j] and c[i+1][j-1]==1:
c[i][j]=1
if longestlen<j-i+1:
longeststr = s[i:j+1]
longestlen =j-i+1
return longeststr