Leetcode -- Longest Palindromic Substring
题目:Given a string S,
find the longest palindromic substring in S.
You may assume that the maximum length of S is
1000, and there exists one unique longest palindromic substring.
这个问题,跟LCS的解题思路上
原创
2015-07-30 00:17:14 ·
399 阅读 ·
0 评论