longest-palindromic-substring

最新推荐文章于 2022-02-20 20:32:16 发布

原创最新推荐文章于 2022-02-20 20:32:16 发布 · 185 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种寻找字符串中最长回文子串的方法，并通过动态规划的方式实现了该算法。通过对字符串进行遍历并更新状态矩阵，最终找到满足条件的最长回文子串。

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

def longestPalindrome(S):
   if len(S) == 0 or len(S) < 2:
      return S
   dp = [[False for _ in range(len(S))] for _ in range(len(S))]
   res = ''
   maxlen = 0
   dp[0][0] = True
   j = 0
   while j < len(S):
      dp[j][j] = True
      i = 0
      while i < j:
         dp[i][j] = (j - i < 2 or dp[i + 1][j - 1]) and S[i] == S[j]
         if dp[i][j] and j-i+1 > maxlen:
            res = S[i:j+1]
            maxlen = j-i+1
         i += 1
      j += 1
   return res
print longestPalindrome("etretretdaadaad")