LeetCode | 214. Shortest Palindrome

 

题外话：

写了非常久的一道题2333333~

 

题目：

Given a string s, you can 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.

 

Example 1:

Input: s = "aacecaaa"
Output: "aaacecaaa"

Example 2:

Input: s = "abcd"
Output: "dcbabcd"

 

Constraints:

• 0 <= s.length <= 5 * 104
• s consists of lowercase English letters only.

 

代码：

class Solution {
public:
    int maxPali(string s) {
        int len = s.length();
        vector<vector<bool>> p(len, vector<bool>(len, false));
        int max_len = -1;
        for(int i = 0; i<len; i++)
        {
            for(int j = i, k = 0; j<len; j++, k++)
            {
                if(j == k)
                    p[k][j] = true;
                else
                    p[k][j] = (s[k] == s[j]) && (p[k+1][j-1] || k == j-1);
            }
        }
        for(int i = len - 1; i > -1; i--)
        {
            if(p[0][i])
            {
                max_len = i;
                break;
            }
        }
        return max_len;
    }
    string shortestPalindrome(string s) {
        int n = s.size();
    string rev(s);
    reverse(rev.begin(), rev.end());
    string s_new = s + "#" + rev;
    int n_new = s_new.size();
    vector<int> f(n_new, 0);
    for (int i = 1; i < n_new; i++) {
        int t = f[i - 1];
        while (t > 0 && s_new[i] != s_new[t])
            t = f[t - 1];
        if (s_new[i] == s_new[t])
            ++t;
        f[i] = t;
    }
    return rev.substr(0, n - f[n_new - 1]) + s;
    }
};