Manacher算法

public class Manacher {
  public static char[] manacherString(String string) {
    char[] charArr = str.toCharArray();
    char[] res = new char[str.length() * 2 + 1];
    int index = 0;
    for (int i = 0; i != res.length; i++) {
      res[i] = (i & 1) == 0 ? '#' : charArr[index++];
    }
  }

  public static int maxLcpLength(String str) {
    if (str == null || str.length() == 0)
      return 0;
    char[] charArr = manacherString(str);
    int[] pArr = new int[charArr.length];
    int C = -1;
    int R = -1;
    int max = Integer.MIN_VALUE;
    for (int i = 0; i < charArr.length; i++) {
      pArr[i] = R > i ? Math.min(pArr[2 * C - i], R - i) : 1;
      while (pArr[i] < Math.min(i + 1, charArr.length - i)) {
        if (charArr[i + pArr[i]] == charArr[i - pArr[i]]) {
          pArr[i]++;

        } else {
          break;
        }
      }

      if (i + pArr[i] > R) {
        R = i + pArr[i];
        C = i;
      }
      max = Math.max(max, pArr[i]);
    }
    return max - 1;
  }
}