2017年8月28日
[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:4One possible longest palindromic subsequenc... 阅读全文
posted @ 2017-08-28 17:51 stAr_1 阅读(149) 评论(0) 推荐(0) 编辑