[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
posted @ 2017-03-02 23:30  Grandyang  阅读(20057)  评论(7)    收藏  举报
Fork me on GitHub