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://blog.csdn.net/crazy__chen/article/details/45456559
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://blog.csdn.net/crazy__chen/article/details/45456559