代码随想录算法训练营第四十天| 647.回文子串 516.最长回文子序列

Ibelievesnape

已于 2024-07-22 01:32:09 修改

阅读量571

点赞数 5

分类专栏：代码随想录算法训练营文章标签：算法

于 2024-07-22 01:30:15 首次发布

本文链接：https://blog.csdn.net/Ibelievesnape/article/details/140597220

版权

代码随想录算法训练营专栏收录该内容

53 篇文章 0 订阅

订阅专栏

647.回文子串

class Solution:
    def countSubstrings(self, s: str) -> int:
        dp = [[False] * len(s) for _ in range(len(s))]
        result = 0
        for i in range(len(s)-1, -1, -1): #注意遍历顺序
            for j in range(i, len(s)):
                if s[i] == s[j]:
                    if j - i <= 1: #情况一 和 情况二
                        result += 1
                        dp[i][j] = True
                    elif dp[i+1][j-1]: #情况三
                        result += 1
                        dp[i][j] = True
        return result

516.最长回文子序列

class Solution:
    def longestPalindromeSubseq(self, s: str) -> int:
        dp = [[0] * len(s) for _ in range(len(s))]
        for i in range(len(s)):
            dp[i][i] = 1
        for i in range(len(s)-1, -1, -1):
            for j in range(i+1, len(s)):
                if s[i] == s[j]:
                    dp[i][j] = dp[i+1][j-1] + 2
                else:
                    dp[i][j] = max(dp[i+1][j], dp[i][j-1])
        return dp[0][-1]