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.  时间复杂度为O(N²)的算法-动态规划
相关文章
相关标签/搜索