[Leetcode] Longest Palindromic Substring 最长回文子字符串 - SegmentFault

[Leetcode] Longest Palindromic Substring 最长回文子字符串 - SegmentFault

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.

Read full article from [Leetcode] Longest Palindromic Substring 最长回文子字符串 - SegmentFault