Longest palindromic substrings: Difference between revisions
m
→Manacher algorithm
Line 141:
for teststring in ["babaccd", "rotator", "reverse", "forever", "several", "palindrome", "abaracadabra"]
pal = manacher(teststring)
println(length(pal) < 2 ? "No palindromes of 2 or more letters found in \"$teststring.\"" :
"The longest palindromic substring of $teststring is: \"$pal\"")
end
Line 151:
The longest palindromic substring of forever is: "rever"
The longest palindromic substring of several is: "eve"
No palindromes of 2 or more letters found in "palindrome."
The longest palindromic substring of abaracadabra is: "ara"
</pre>
| |||