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.
http://fisherlei.blogspot.com/2012/12/leetcode-longest-palindromic-substring.html
http://blog.csdn.net/yzl_rex/article/details/7908259
时间: 2024-10-14 05:49:36