[LeetCode OJ]Longest Palindromic Subsequence

【问题描述】

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:

4

One possible longest palindromic subsequence is "bbbb".

Example 2:
Input:

"cbbd"

Output:

2

One possible longest palindromic subsequence is "bb".

问题来源：longest-palindromic-subsequence

【解题分析】

题意是寻找最长的回文子串，但并不是需要最长的连续回文子串。

我们定义$dp[i][j]$为第$i$个数到第$j$个数之间最长的回文子串$(i≤j)$，于是有如下等式出现：
dp[i][j] = dp[i+1][j-1] + 2                     if (s[i]=s[j])
dp[i][j] = max(dp[i+1][j],dp[i][j-1])       otherwise
我们初始化dp[i][i] = 1(0≤i<s.length())，其余皆为0。

最后返回dp[0][s.length()-1]，时间复杂度为O(N^2)，空间复杂度为O(N^2)。

【源代码】

class Solution {
public:
    int longestPalindromeSubseq(string s) {
        vector<vector<int> > dp(s.length(),vector<int> (s.length()));

        for (int i = s.length() - 1; i >= 0 ; i--) {
        	dp[i][i] = 1;
        	for (int j = i + 1; j < s.length(); j++) {
        		if (s[i] == s[j]) {
        			dp[i][j] = dp[i+1][j-1] + 2;
        		} else {
        			dp[i][j] = max(dp[i][j-1], dp[i+1][j]);
        		}
        	}
        }

        return dp[0][s.length()-1];
    }
};