5. Longest Palindromic Substring

题目:

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.

链接：https://leetcode.com/problems/longest-palindromic-substring/

题解：

 

Reference: