这道题目要求在最少的步数内将给定的字符串转化为超级回文串，即所有奇数长度的子串都是回文。可以通过全排列检查每个可能的两个字符组合，或判断是否为单一字符的回文串来解决。对于第二个测试用例'aaaaba'，只需一步即可将其变为'aaaaaa'。
Super-palindrome
时间限制: 1 Sec 内存限制: 128 MB
提交: 486 解决: 166
[提交] [状态] [命题人:admin]
题目描述
You are given a string that is consisted of lowercase English alphabet. You are supposed to change it into a super-palindrome string in minimum steps. You can change one character in string to another letter per step.
A string is called a super-palindrome string if all its substrings with an odd length are palindrome strings. That is, for a string s, if its substring si...j satisfies j - i + 1 is odd then si+k = sj-k for k = 0,1,...,j-i+1.
输入
The fi rst line contains an integer T (1≤T≤100) representing the number of test cases.
最低0.47元/天 解锁文章
扫一扫
1744
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
