-
Notifications
You must be signed in to change notification settings - Fork 19.7k
/
Copy pathManacher.java
69 lines (59 loc) · 2.12 KB
/
Manacher.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
package com.thealgorithms.strings;
/**
* Wikipedia: https://en.wikipedia.org/wiki/Longest_palindromic_substring#Manacher's_algorithm
*/
public final class Manacher {
private Manacher() {
}
/**
* Finds the longest palindromic substring using Manacher's Algorithm
*
* @param s The input string
* @return The longest palindromic substring in {@code s}
*/
public static String longestPalindrome(String s) {
final String processedString = preprocess(s);
int[] palindromeLengths = new int[processedString.length()];
int center = 0;
int rightBoundary = 0;
int maxLen = 0;
int centerIndex = 0;
for (int i = 1; i < processedString.length() - 1; i++) {
int mirror = 2 * center - i;
if (i < rightBoundary) {
palindromeLengths[i] = Math.min(rightBoundary - i, palindromeLengths[mirror]);
}
while (processedString.charAt(i + 1 + palindromeLengths[i]) == processedString.charAt(i - 1 - palindromeLengths[i])) {
palindromeLengths[i]++;
}
if (i + palindromeLengths[i] > rightBoundary) {
center = i;
rightBoundary = i + palindromeLengths[i];
}
if (palindromeLengths[i] > maxLen) {
maxLen = palindromeLengths[i];
centerIndex = i;
}
}
final int start = (centerIndex - maxLen) / 2;
return s.substring(start, start + maxLen);
}
/**
* Preprocesses the input string by inserting a special character ('#') between each character
* and adding '^' at the start and '$' at the end to avoid boundary conditions.
*
* @param s The original string
* @return The preprocessed string with additional characters
*/
private static String preprocess(String s) {
if (s.isEmpty()) {
return "^$";
}
StringBuilder sb = new StringBuilder("^");
for (char c : s.toCharArray()) {
sb.append('#').append(c);
}
sb.append("#$");
return sb.toString();
}
}