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.
class Solution {
public:
string longestPalindrome(string s) {
}
};
[leetcode] 5.Longest Palindromic Substring
原文：http://www.cnblogs.com/lzz-rcpp/p/4583247.html