标签：
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
[LeetCode] Longest Palindromic Substring 最长回文串
标签：
原文地址：http://www.cnblogs.com/grandyang/p/4464476.html
