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.html 这道求最长回文子串的题目很是经典,也有很是
相关文章
相关标签/搜索