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

题意

给定一个字符s,找到s中子序列中最长的回文串的长度。你可以假设最大长度为1000.

分析及解答

摘自：