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://www.cnblogs.com/yangscode/p/5017527.html
