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. Given a string S, find the longest palindromic sub
阅读背景：
Longest Palindromic Substring(最长回文子串)
来源：互联网
分享到：
