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.
{优快云:CODE:633838}
本文介绍了一种方法,用于在一个给定字符串中找到最长的回文子串。假设字符串的最大长度为1000,并且存在唯一的最长回文子串。
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.

被折叠的 条评论
为什么被折叠?