Content deleted Content added
→Runtime: i am taking back my previous edit of 2n+1 -> 2n as after center becomes 2n it will be incremented one last time inside the loop before being rejected by the while loop for being not less than 2n+1. |
Attribution |
||
Line 154:
}
===Special
Manacher's algorithm is faster because it reuses precomputed data when a palindrome exists inside another palindrome. There are 3 cases of this. They are represented by the "if / else if / else" statement in the pseudocode.
Line 251:
| year = 1975| s2cid = 10615419
}}.
==External links==
Line 260 ⟶ 261:
[[Category:Problems on strings]]
[[Category:Palindromes]]
▲:''This article incorporates text from [https://web.archive.org/web/20180629091030/http://wcipeg.com/wiki/index.php?title=Longest_palindromic_substring Longest palindromic substring] on PEGWiki under a Creative Commons Attribution ([https://creativecommons.org/licenses/by/3.0/ CC-BY-3.0]) license.''
| |||