题目:
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.
Example 1:
Input:
"bbbab"Output:
4One possible longest palindromic subsequence is "bbbb".
Example 2:
Input:
"cbbd"Output:
2
One possible longest palindromic subsequence is "bb".
解题思路:该问题可以转化为求给定的字符串s与s的倒序的最长公共序列的长度。可以使用动态规划中解决经典的字符串最短编辑问题的方法来解决这个问题。那么怎么求两个字符串s1、s2的最长公共子序列的长度呢?
在字符串s1、s2的比较中,会出现三种可能:
假设length(i,j)表示由字符串s1前i个字符组成的字符串与由字符串s2前j个字符组成的字符串的最长公共子序列的长度.
1.s1[i]不与s2[j]比较而与s2[j]之后的元素比较,length(i,j) = length(i-1,j);
2.s2[j]不与s1[i]比较而与s1[i]之后的元素比较,length(i,j) = length(i,j-1);
3.s1[i]与s2[j]比较,length(i,j) = length(i-1,j-1) + same(i,j) (若s1[i]=s2[j]则same(i,j)=1否则为0);
那么有:
length(i,j) = max{ length( i-1 , j ), length( i , j-1 ), length( i-1 , j-1 ) + same( i , j ) }
代码如下:
class Solution {
public:
int longestPalindromeSubseq(string s) {
if(s.size() == 0) return 0;
string rs(s.rbegin(),s.rend());
vector<int> temp(s.size()+1,0);
vector<vector<int>> length(s.size()+1,temp);
int same = 0;
for(int i = 1; i != s.size()+1; ++i){
for(int j = 1; j != s.size()+1; ++j){
if(s[i-1]==rs[j-1]){
same = 1;
}
else{
same = 0;
}
length[i][j] = max(length[i-1][j],max(same+length[i-1][j-1],length[i][j-1]));
}
}
return length[s.size()][s.size()];
}
};