[LeetCode] 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

[LeetCode] Longest Palindromic Subsequence 最长回文子序列

原文：http://www.cnblogs.com/grandyang/p/6493182.html