2017年7月19日
[Leetcode] DP-- 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-07-19 12:47 安新 阅读(122) 评论(0) 推荐(0) 编辑