Manacher马拉车算法总结

http://blog.csdn.net/dyx404514/article/details/42061017

附java代码

private static String preProcess(String s){
        int n = s.length();
        if (n == 0) return "^$";
        String result = "^";
        for (int i = 0; i < n; i++) {
            result += "#" + s.charAt(i);
        }
        result += "#$";
        return  result;
    }
    public String longestPalindrome(String s) {
        char[] T = preProcess(s).toCharArray();
        int n = T.length;
        int[] P = new int[n];
        int C = 0, R = 0;
        for (int i = 1; i < n-1; i++) {
            int i_mirror = 2*C - i; // equals to i' = C - (i-C)
            P[i] = R > i ? Math.min(P[i_mirror], R - i) : 0;
            // Attempt to expand palindrome centered at i
            while( T[i+1+P[i]] == T[i-1-P[i]] )
                P[i]++;
            // if palindrome centered at i expand past R
            // adjust center based on expanded palindrome
            if ( i + P[i] > R) {
                C = i;
                R = i + P[i];
            }
        }
        int maxLen = 0;
        int centerIndex = 0;
        for (int i = 1; i < n-1 ; i++) {
            if (P[i] >  maxLen) {
                maxLen = P[i];
                centerIndex = i;
            }
        }
        int beginIndex = (centerIndex-1-maxLen)/2;
        return s.substring(beginIndex, beginIndex+maxLen);
    }