516[Medium]: Longest Palindromic Subsequence

Part1:题目描述

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".

Part2:解题思路

动态规划方程：

Part3:代码

class Solution {
public:
    int longestPalindromeSubseq(string s) {
	int length = s.length();
	vector<vector<int> >dp(length, vector<int>(length));
	for (int i = length - 1; i >= 0; i--) {
		dp[i][i] = 1;
		for (int j = i + 1; j < length; j++) {
			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][length - 1];
}
};