Description:
Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.
For example:
Given “aacecaaa”, return “aaacecaaa”.
Given “abcd”, return “dcbabcd”.
分析:我的想法是采用朴素的BF算法,题目中关键的一个词是in front of,即在原字符串前面添加若干字符。因此,我们可以先求原字符串的前缀与翻转后的字符串的后缀之间最长的匹配串,然后再往该前缀前面添加两者未匹配的部分即可。
例如:s = abaa 那么 rev = aaba
s的前缀与rev的后缀中匹配的最长字串为aba
再往s首部添上未匹配的a(或者是往rev的尾部添上未匹配的a)就得到最终的结果aabaa了。
注意:处理空串的情况
Submission Details:
120 / 120 test cases passed.
Status: Accepted
Runtime: 82 ms
class Solution {
public:
string shortestPalindrome(string s) {
int len = s.length();
string rev = s; // 用于记录翻转后的字符串
reverse(rev.begin(), rev.end());
for (int i = 0; i < len; i++) {
if (s.substr(0, len - i) == rev.substr(i)) //从长到短求匹配的最长子串
return rev.substr(0, i) + s; //连接后的串
}
return "";
}
};