该博客介绍了如何解决寻找字符串的最大回文子序列问题，包括使用最长公共子序列（LCS）算法和动态规划（DP）方法。通过LCS算法可能无法直接得到回文串，但可以确定回文串长度，而DP方法能更直接地求解，但状态转移方程较为复杂。博客给出了两种方法的代码实现。
ASubsequence is a sequence obtained by deleting zero or more characters in astring. A Palindrome is a string which when read from left to right, reads sameas when read from right to left. Given a string, find the longest palindromicsubsequence. If there are many answers to it, print the one that comes lexicographicallyearliest.
Constraints
• Maximum length of string is 1000.
• Each string has characters `a' to `z' only.
Input
Inputconsists of several strings, each in a separate line. Input is terminated byEOF.
Output
For eachline in the input, print the output in a single line.
Sample Input
最低0.47元/天 解锁文章
扫一扫
1657
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
