【dp刷题】最长回文子序列-516

最新推荐文章于 2020-06-14 21:59:18 发布

保可洛

最新推荐文章于 2020-06-14 21:59:18 发布

阅读量248

点赞数

本文链接：https://blog.csdn.net/njh_i_d/article/details/105956765

版权

class Solution:
    def longestPalindromeSubseq(self, s):
        '''dp[i][j]表示从i到j，最长子序列长度
        状态转移方程：
        if dp[i] == dp[j]:dp[i][j] = dp[i+1][j-1] + 2
        else: dp[i][j] = max(dp[i][j-1], dp[i+1][j])
        base状态：全部初始化为零，i,j相等处赋值为1
        '''
        n = len(s)
        dp = [[0]*n for _ in range(n)]
        for i in range(n):
            dp[i][j] = 1
        for i in range(n,-1,-1):
            for j in range(i+1,n):
                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][n-1]