摘要:
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. 判断字符串中最长的回文子串,子串不一定要连续。 阅读全文
posted @ 2018-04-06 15:47
Zzz...y
阅读(193)
评论(0)
推荐(0)