leetcode 516. Longest Palindromic Subsequence

题目链接 516. Longest Palindromic Subsequence

等级： medium

思路

动态规划， df[i][j]表示 s[i … j] 的最长回文字串长度
df[i][j] = max(df[i + 1][j], df[i][j - 1], df[i + 1][j - 1] + 2), if s[i] == s[j];
df[i][j] = max(df[i + 1][j], df[i][j - 1], df[i + 1][j - 1]), if s[i] != s[j];
df[i][j] = 1, if i == j;
df[i][j] = (s[i] == s[j]) ? 2 : 1, if j = i + 1;

实现

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

# include <iostream>
# include <vector>

using namespace std;

class Solution {
public:
    int longestPalindromeSubseq(string s) {
        int size = s.size();
        if(size <= 1) return size;
        if(size == 2) return s[0] == s[1] ? 2 : 1;

        vector< vector<int> > df(size, vector<int>(size, 0));
        for(int i = 0; i < size; i++) df[i][i] = 1;
        for(int i = 0; i < size - 1; i++) df[i][i + 1] = (s[i] == s[i + 1]) ? 2 : 1;
        for(int k = 3; k <= size; k++) {
            for(int i = 0; i + k -1 < size; i++) {
                int j = i + k - 1;
                if(s[i] == s[j])
                    df[i][j] = max(max(df[i + 1][j], df[i][j - 1]), df[i + 1][j - 1] + 2);
                else
                    df[i][j] = max(max(df[i + 1][j], df[i][j - 1]), df[i + 1][j - 1]);
            }
        }
        return df[0][size - 1];
    }
};