LeetCode - Shortest Palindrome (KMP)

最新推荐文章于 2019-12-04 14:51:46 发布

风小西

最新推荐文章于 2019-12-04 14:51:46 发布

阅读量370

点赞数

分类专栏： Leetcode 文章标签： leetcode 字符串 kmp

本文链接：https://blog.csdn.net/fenx91/article/details/47257919

版权

Leetcode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

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".

思路：主要是要看从字符串的最左侧起的最长回文串是什么，可以借助kmp中最长公共前缀后缀的计算方法来计算

class Solution {
public:
    string shortestPalindrome(string s) {
        string r = s;
        reverse(r.begin(), r.end());
        string t = s + "#" + r;
        int l = t.length();
        vector<int> p(l, 0);
        for(int i = 1; i < l; ++i){
            int j = p[i - 1];
            while(j > 0 && t[j] != t[i]) j = p[j - 1];
            p[i] = j + (t[j] == t[i]);
        }
        return r.substr(0, r.size() - p[l - 1]) + s;
    }
};