给定一个长度至少为N的整数，任务是生成一个回文串。原代码可能存在错误，需要在输入字符串尾部添加字符确保其成为回文。解决方案是找到输入串尾部的最大回文子串，将其左侧字符逆序添加到原始串尾部。可以使用hash或KMP算法来找到最长相同部分，然后构建最小的回文串。
原题链接，进去比较慢
Description
Your task is, given an integer N, to make a palindrome (word that reads the same when you reverse it) of length at least N (1 <= N <= 100,000). Any palindrome will do.
Easy, isn't it? That's what you thought before you passed it on to your inexperienced team-mate. When the contest is almost over, you find out that that problem still isn't solved. The problem with the code is that the strings generated are often not palindromic. There's not enough time to start again from scratch or to debug his messy code.
Seeing that the situation is desperate, you decide to simply write some additional code that takes the output and adds just enough extra characters to it to make it a palindrome and hope for the best. Your solution should take as i
最低0.47元/天 解锁文章
扫一扫
324
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
