[LeetCode] Longest Palindrome 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.面DP题的考官都是神经病。。(吐