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

最新推荐文章于 2024-11-12 12:29:51 发布

jinshengqile

最新推荐文章于 2024-11-12 12:29:51 发布

阅读量252

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/jinshengqile/article/details/141759759

版权

题目链接：647. 回文子串 - 力扣（LeetCode）

class Solution(object):
    def countSubstrings(self, s):
        """
        :type s: str
        :rtype: 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. 最长回文子序列 - 力扣（LeetCode）

class Solution(object):
    def longestPalindromeSubseq(self, s):
        """
        :type s: str
        :rtype: 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)):
                print(i)
                print(j)
                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]