Longest palindromic substring: Difference between revisions

Content deleted Content added
OAbot (talk | contribs)
m Open access bot: doi updated in citation with #oabot.
Manacher's algorithm: A simpler way of expressing the intent of the comparison. The other way doesn't make sense for cases where the index type is unsigned.
Line 82:
// going to Center+Radius
while Center-(Radius+1) >=< 0length(S') and
Center+(Radius+1) < length(S') and
S'[Center-(Radius+1)] = S'[Center+(Radius+1)] {