2017年3月2日
[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 阅读(19817) 评论(7) 推荐(1) 编辑
Fork me on GitHub