题目：
题解：
class Solution:def longestPalindromeSubseq(self, s: str) -> int:n = len(s)dp = [[0] * n for _ in range(n)]for i in range(n - 1, -1, -1):dp[i][i] = 1for j in range(i + 1, n):if s[i] == s[j]:dp[i][j] = dp[i + 1][j - 1] + 2else:dp[i][j] = max(dp[i + 1][j], dp[i][j - 1])return dp[0][n - 1]
![[Python学习日记-53] Python 中的正则表达式模块 —— re](https://i-blog.csdnimg.cn/direct/a75738bfe8694652aaea386e5822f25f.png)
