在算法课上，教授提出了一个问题：如何高效找到字符串中最大回文子串的长度？学生们提出的基本思路是检查所有子串，但Andy提出了一种更优的解决方案。他的最终方法包括暴力解法、字符串哈希以及Manacher算法，其中Manacher算法能在O(N)的时间复杂度内解决问题。题目提供了一些测试用例，输入包含多个字符串，以'END'结束，输出每个测试用例的序号和最大回文子串的长度。
Andy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, "Can you propose an efficient algorithm to find the length of the largest palindrome in a string?"
A string is said to be a palindrome if it reads the same both forwards and backwards, for example "madam" is a palindrome while "acm" is not.
The students recognized that this is a classical problem but couldn't come up with a solution better than iterating over all substrings and checking whether they are palindrome or not, obviously this algorithm is not efficient at all, after a while Andy raised his hand and said "Okay, I've a better algorithm" and before he starts to explain his idea he stopped for a moment and then said "Well, I've an even better algorithm!".
If you think you know Andy's final solution then prove it! Given a string of at most 1000000 characters find and
最低0.47元/天 解锁文章
211
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
