leetcode 日经贴，Cpp code -Shortest Palindrome

bachelorchen

于 2015-05-24 14:04:33 发布

阅读量307

点赞数

分类专栏：算法 Cpp leetcode

本文链接：https://blog.csdn.net/bachelorchen/article/details/45951581

版权

算法同时被 3 个专栏收录

183 篇文章 0 订阅

订阅专栏

leetcode

173 篇文章 0 订阅

订阅专栏

Cpp

152 篇文章 0 订阅

订阅专栏

Shortest Palindrome

class Solution {
public:
    bool isPalindrome(const string &s, int st, int ed) {
        while (st < ed) {
            if (s[st] != s[ed]) {
                return false;
            }
            ++st;
            --ed;
        }
        return true;
    }
    int ord(char ch) {
        return int(ch);
    }
    string shortestPalindrome(string s) {
        int n = s.length();
        if (n <= 1) {
            return s;
        }
        int mod = 100000009, base1 = 3, base2 = 7;
        vector<int> hash(n + 1);
        long long b1 = 1, b2 = 1;
        hash[1] = 1;
        long long h1 = 0, h2 = 0, t1 = 0, t2 = 0;
        for (int i = 0; 2 * (i + 1) <= n; ++i) {
            h1 = (h1 + b1 * ord(s[i])) % mod;
            h2 = (h2 + b2 * ord(s[i])) % mod;
            t1 = (t1 * base1 + ord(s[2 * i + 1])) % mod;
            t2 = (t2 * base2 + ord(s[2 * i + 1])) % mod;
            if (h1 == t1 && h2 == t2) {
                hash[2 * (i + 1)] = 1;
            }
            if (2 * (i + 1) < n) {
                t1 = (t1 - b1 * ord(s[i + 1]) + mod) % mod;
                t2 = (t2 - b2 * ord(s[i + 1]) + mod) % mod;
                t1 = (t1 + mod) % mod;
                t2 = (t2 + mod) % mod;
                t1 = t1 * base1 + ord(s[2 * (i + 1)]);
                t2 = t2 * base2 + ord(s[2 * (i + 1)]);
                if (h1 == t1 && h2 == t2) {
                    hash[2 * (i + 1) + 1] = 1;
                }
                b1 = b1 * base1 % mod;
                b2 = b2 * base2 % mod;
            }
        }
        for (int i = 0; i < n; ++i) {
            if (hash[n - i] && isPalindrome(s, 0, n - i - 1)) {
                string head = s.substr(n - i, i);
                reverse(head.begin(), head.end());
                return head + s;
            }
        }
    }
};